只有1 4 7三个AC，剩下的满江红

#include<bits/stdc++.h>
using namespace std;
int m,n,k,t,s;
struct peanut{int x,y,num;};
vector<peanut> a;
int go(peanut a,peanut b){
    return abs(a.x-b.x)+abs(a.y-b.y)+1;
}
bool cmp(peanut a,peanut b){
    return a.num>b.num;
}
int main(){
    cin>>m>>n>>k;
    for(int i=1;i<=m;i++)for(int j=1;j<=m;j++){
        int tmp;cin>>tmp;
        if(tmp)a.push_back((peanut){i,j,tmp});
    }
    sort(a.begin(),a.end(),cmp);
    t=a[0].x;s=a[0].num;
    for(int i=1;i<a.size();i++){
        t+=go(a[i-1],a[i]);s+=a[i].num;
        if(t+a[i].x > k)break;
    }
    cout<<s;return 0;
}