贪心做合并果子

这个应该可以算贪心吧

program asdf;
var
a,b:array[1..10002]of longint;
i,j,n,p,t,x,y,min,method,ans:longint;
num:array[1..20000]of longint;
{function bj:longint;
begin
if a[x]>a[y]
then begin bj:=a[x];inc(i);end
else begin bj:=b[y]; inc(y);end;
end;}
begin
readln(n);
fillchar(num,sizeof(num),0);
for i:=1 to n do
begin
read(t);
inc(num[t]);
b[i]:=10000000;
end;
p:=0;
for i:=1 to 20000 do
for j:=1 to num[i] do
begin
inc(p);
a[p]:=i;
end;
p:=0;
x:=1;
y:=1;
ans:=0;
a[n+1]:=1000000000;
a[n+2]:=1000000000;
for I:=1 to n-1 do
begin
min:=maxlongint;
if (a[x]+a[x+1]<min)
then begin
min:=a[x]+a[x+1];
method:=1;
end;
if (a[x]+b[y]<min)
then begin
min:=a[x]+b[y];
method:=2;
end;
if (b[y]+b[y+1]<min)
then begin
min:=b[y]+b[y+1];
method:=3;
end;
p:=p+1;
b[p]:=min;
ans:=ans+min;
if method=1 then inc(x,2);
if method=2 then begin inc(x);inc(y);end;
if method=3 then inc(y,2);

{inc(p);
b[p]:=bj+bj;}
end;
write(ans);
end.