CSP-J 2004 T2 花生采摘 30分求调 玄关

#include <bits/stdc++.h>
#define int long long
#define KD return
using namespace std;
int n, m, k, u = 1, last_i, last_j, ans;
struct Kevin {
    int v, v_i, v_j;
};
Kevin d[735];
bool cmp (Kevin x, Kevin y) {
    KD x.v > y.v;
}

signed main () {
    cin >> n >> m >> k;
    for (int i = 1;i <= n;i ++) {
        for (int j = 1;j <= m;j ++) {
            int a;
            cin >> a;
            d[u].v = a, d[u].v_i = i, d[u].v_j = j;
            u ++;
        }
    }
    sort (d + 1, d + 1 + (n * m), cmp);
    last_i = d[1].v_i, last_j = d[1].v_j;
    if (min (last_i, last_j) > k) {
        cout << 0;
        KD 0;
    }
    if (min (last_i, last_j) == k) {
        cout << d[1].v;
        KD 0;
    }
    ans += d[1].v;
    k -= min (last_i, last_j);
    for (int i = 2;i <= n * m;i ++) {
        int sum = abs(last_i - d[i].v_i) + abs (last_j - d[i].v_j) + 1;
        int sum1 = min (d[i].v_i, d[i].v_j);
        if (k - sum - sum1 < 0) {
            cout << ans;
            KD 0;
        }
        if (k - sum  - sum1> 0) ans += d[i].v, last_i = d[i].v_i, last_j = d[i].v_j, k -= sum;
        if (k - sum - sum1 == 0) {
            cout << ans + d[i].v;
            KD 0;
        }
    }
    cout << ans;
    KD 0;
}