花生采摘

 巧妙的水题

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')  f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return f*x;
}
struct map { int x,y,z; } a[500];
int n,m,k,a1,num,ans,hour;
bool cmp(const map &a,const map &b)
{
	return a.z>b.z;
}
int main()
{
	n=read();  m=read();  k=read();
	for(int i=1;i<=n;i++)
	  for(int j=1;j<=m;j++)
	  {
	  	a1=read();
	  	if(a1)
	  	{
	  		num++;
	  		a[num].x=i;
	  		a[num].y=j;
	  		a[num].z=a1;
		}
	  }
	sort(a+1,a+num+1,cmp);
	if(a[1].x*2+1>k)
	{
		cout<<0;
		return 0;
	}
	else
	{
		ans=a[1].z;
		hour=a[1].x+1;
	}
	for(int i=2;i<=num;i++)
	{
		hour+=abs(a[i].x-a[i-1].x)+abs(a[i].y-a[i-1].y)+1;
		if(hour+a[i].x>k)  break;
		ans+=a[i].z;
	}
	cout<<ans;
	return 0;
}