这一题有很多种解题方法,但思想都是每次合并所需体力最少的两堆,最朴素算法的是冒泡排序,然后是快排、堆排,桶排也是一种非常快的,因为每堆果子不超过20000。
Wikioi上面将这一题归类在堆中,这里就附堆排维护的程序。
program P1063;
var
a:array[0..10002] of longint;
i,ans,n,x,h:longint;
procedure Delete_Num;//将堆顶删除并对新的堆进行维护
var
i,t:longint;
begin
a[1]:=a[a[0]];a[a[0]]:=maxlongint;
dec(a[0]);
i:=1;
while (a[i*2]<a[i])or(a[i*2+1]<a[i]) do
begin
if a[i*2]<a[i*2+1] then
begin
t:=a[i];a[i]:=a[i*2];a[i*2]:=t;
i:=i*2;
end else
begin
t:=a[i];a[i]:=a[i*2+1];a[i*2+1]:=t;
i:=i*2+1;
end;
if i*2>a[0] then exit;
end;
end;
function Get_Num:longint;
begin
exit(a[1]);
end;
procedure Insert_Num(k:longint);//将一堆新的果子加入堆中并进行维护
var
i,t:longint;
begin
inc(a[0]);
a[a[0]]:=k;
i:=a[0];
while (i>1)and(a[i]<a[i div 2]) do
begin
t:=a[i];a[i]:=a[i div 2];a[i div 2]:=t;
i:=i div 2;
end;
end;
begin
filldword(a,sizeof(a) div 4,maxlongint);
readln(n);
read(x);
a[0]:=0;
for i:=1 to n do
begin
read(x);
Insert_Num(x);
end;
for i:=1 to n-1 do//进行n-1次合并操作
begin
x:=Get_Num;
Delete_Num;
x:=x+Get_Num;
Delete_Num;
ans:=ans+x;
Insert_Num(x);
end;
writeln(ans);
end.