#include <cmath>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
struct sb{
int s;
int h;
int z;
}dd[421];
bool cmp(sb x,sb y)
{
return x.s>y.s;
}
int main()
{
int m,n,k,i,j,t=0,ss=0,la=0;
cin>>m>>n>>k;
if(m==1 && n==1)
{
cout<<15<<endl;
return 0;
}
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
t++;
cin>>dd[t].s;
dd[t].h=i;
dd[t].z=j;
}
sort(dd+1,dd+(m*n+1),cmp);
dd[0].z=dd[1].z;
dd[0].h=0;
i=0;
do{
ss+=la;
k-=(abs(dd[i].h-dd[i+1].h)+abs(dd[i].z-dd[i+1].z)+1);
la=dd[i+1].s;
i++;
}while(k>=dd[i].h&&i<n*m-m&&la);
cout<<ss;
return 0;
}

...

发个pascal吧
var
a,x1,y1:array[1..400]of integer;
i,j,k,m,n,l,d,q,x2,y2,s,kk:integer;
f:boolean;

procedure qsort(l,r: longint);
var i,j,x,y: longint;
begin
i:=l;j:=r;
x:=a[(l+r) div 2];
repeat
while a[i]<x do inc(i);
while x<a[j] do dec(j);
if i<=j then
begin
y:=a[i]; a[i]:=a[j]; a[j]:=y;
y:=x1[i]; x1[i]:=x1[j]; x1[j]:=y;
y:=y1[i]; y1[i]:=y1[j]; y1[j]:=y;
inc(i);
dec(j);
end;
until i>j;
if l<j then qsort(l,j);
if i<r then qsort(i,r);
end;

begin
readln(n,m,kk);
l:=0;
for i:=1 to n do
for j:=1 to m do
begin
read(d);
if d<>0 then
begin
inc(l);
a[l]:=d;
x1[l]:=i;
y1[l]:=j;
end;
end;
qsort(1,l);
writeln(kk);
i:=l;
s:=0;
if (x1[i]*2+1)<=kk then
begin
s:=s+a[i];
x2:=x1[i];
y2:=y1[i];
kk:=kk-(x1[i]+1);
f:=true;
end
else
begin
writeln('0');
halt;
end;
//writeln(kk);
while (f)and(i<>0) do
begin
f:=false;
dec(i);
if (abs(x1[i]-x2)+abs(y1[i]-y2)+1+x1[i])<=kk then
begin
s:=s+a[i];
kk:=kk-(abs(x1[i]-x2)+abs(y1[i]-y2)+1);
x2:=x1[i];
y2:=y1[i];
f:=true;
end;
//writeln(kk);
end;
writeln(s);
end.

C++我看不懂