有没有dalao能够帮orz改下错的，万分感谢。。

#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
struct node{
    int x,y,w;
    friend bool operator < (node a, node b) {
        return a.w < b.w;
    }
};
inline int read() {
    int x=0;char c=getchar();
    while(c<'0'||c>'9') c=getchar();
    while(c<='9'&&c>='0')x=(x<<3)+(x<<1)+c-'0',c=getchar();
    return x;
}
int dis(node a,node b) {return abs(a.x-b.x)+abs(a.y-b.y);}
priority_queue<node> q; 
int main(){
    int m=read(),n=read(),k=read(),x;
    for(int i=1; i<=m; i++) 
        for(int j=1; j<=n; j++) {
            if(x=read()) q.push((node){i,j,x});
        }
    if(2*q.top().x + 1 > k) {puts("0");return 0;}
    int t = q.top().x + 1,ans=q.top().w;
    for(int i=1; i<q.size(); i++){
        node p=q.top();q.pop();
        t += dis(p,q.top()) + 1;
        if(t + q.top().x <= k) ans += q.top().w;
        else break;
    }
    printf("%d\n",ans);
    return 0;
}