1765K - Torus Path - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
const int INF = numeric_limits<int>::max();
const int nax = (int)(590001);
const int mod = 1e9 + 7;

template<class X, class Y>
bool maximize(X& x, const Y y) {
    if (y > x) {x = y; return true;}
    return false;
}
template<class X, class Y>
bool minimize(X& x, const Y y) {
    if (y < x) {x = y; return true;}
    return false;
}

int nxt() {
    int x; cin >> x;
    return x;
}

#define Fi first
#define Se second
#define pii pair<int, int> 
#define vi vector<int>
#define vvi vector<vi>

void solve() {
    int n; cin >> n;

    vvi grid(n, vi(n));

    int sum = 0;

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            cin >> grid[i][j];
            sum += grid[i][j];
        } 
    }

    int mini = INT_MAX;

    // for(int i = 0; i < n - 1; i++) {
    //     mini = min(mini, grid[i][i + 1]);
    // }

    for(int i = 0; i < n; i++) {
        mini = min(mini, grid[i][n - i - 1]);
    }

    cout << (sum - mini) << '\n';
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    // code here
    solve();

    return 0;
}