采花生

题目：https://www.nowcoder.com/pat/2/problem/249

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 10005;
struct node{
    int x, y;
    int v;
}a[maxn];

bool cmp(node z, node b){
    return z.v > b.v;
}

int main(){
    std::ios::sync_with_stdio(false);
    int m, n, k, v;
    while (cin >> m >> n >> k){
        int len = 0;
        for (int i = 1; i <= m; i++){
            for (int j = 1; j <= n; j++){
                cin >> v;
                if (v == 0)
                    continue;
                a[len].v = v;
                a[len].x = i;
                a[len].y = j;
                len++;
            }
        }
        sort(a, a + len, cmp);
        int ans = 0;
        int time = 0;
        bool ok = 1;
        for (int i = 0; i < len; i++){
            if (ok){
                ok = 0;
                if (time + a[i].x + 1 + a[i].x > k)
                    break;
                else{
                    ans += a[i].v;
                    time += a[i].x+ 1;
                }
            }
            else{
                int sum = abs(a[i].x - a[i - 1].x) + abs(a[i].y - a[i - 1].y);
                if (time + sum + 1 + a[i].x > k)
                    break;
                else{
                    ans += a[i].v;
                    time += sum + 1;
                }
            }
        }
        cout << ans << endl;
    }
    //system("pause");
    return 0;
}