【p1086-花生采摘】解题记录

#include <cstdio>
#include <queue>
#include <cmath>
using namespace std;

int width, height, time, ans=0;

struct Unit{
int x, y, n;
bool operator<(const Unit u)const{
return this->n<u.n;
}
};

priority_queue<Unit> pq;

int main(){

scanf("%d%d%d", &height, &width, &time);

//printf("height=%d, width=%d, time=%d\n", height, width, time);

for(int y=0; y<height; ++y){
for(int x=0; x<width; ++x){
static int n;
scanf("%d", &n);
if(n>0){
pq.push((Unit){x, y, n});
}
}
}

time-=2;
Unit maxu= pq.top();
int posx= maxu.x, posy=0;
while(true){
maxu= pq.top();
pq.pop();
int to_time= abs(posx-maxu.x)+abs(posy-maxu.y);
int stay_time= 1;
int back_time= maxu.y;
int total_time= to_time + stay_time + back_time;

if(total_time>time){
break;
}
else{
time-= to_time+stay_time;
ans+= maxu.n;
posx= maxu.x;
posy= maxu.y;
}
if(pq.empty()) break;
}

printf("%d\n", ans);

return 0;
}