70分，调试不能，求解惑

#include<cstdio>
#include<cstdlib>
using namespace std;
int js=0;
struct gains{
    int x,y,n;
}gains[900];
struct rob{
    int x,y;
}dog;
int find();
int main()
{
    freopen("in.txt","r",stdin);
    freopen("tout.txt","w",stdout);
    int row,coulmn,time;
    int ans=0;
    dog.y=0;
    scanf("%d%d%d",&row,&coulmn,&time);
    for(int i=1; i<=row; i++)
        for(int j=1; j<=coulmn; j++)
        {
            gains[js].x=j;
            gains[js].y=i;
            scanf("%d",&gains[js].n);
            js++;
        }
    int cho=find();
    dog.x=gains[cho].x;
    while(cho!=-1)
    {
        int temp=abs(gains[cho].x-dog.x)+abs(gains[cho].y-dog.y)+1;
        time-=temp;
        if(time-gains[cho].y>=0)
        {
            ans+=gains[cho].n;
            dog.x=gains[cho].x;
            dog.y=gains[cho].y;
        }
        else
        break;
        gains[cho].n=0;
        cho=find();
    }
    printf("%d",ans);
    fclose(stdin);
    fclose(stdout);
    return 0;
}
int find()
{
    int finds=0;
    int max=0;
    for(int i=0;i<=js;i++)
        if(gains[i].n>max)
        {
            max=gains[i].n;
            finds=i;
        }
    if(finds>0)
    return finds;
    else
    return -1;
}