大牛求助，哪错了？？？

P1097合并果子
var
a:array[1..100000000] of longint;
i,j,s,n:longint;
procedure sort(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 not(i>j) then
begin
y:=a[i];
a[i]:=a[j];
a[j]:=y;
inc(i);
j:=j-1;
end;
until i>j;
if l<j then
sort(l,j);
if i<r then
sort(i,r);
end;
begin
read(n);
for i:=1 to n do
read(a[i]);
sort(1,n);
i:=2; j:=0; s:=a[1]+a[2];
repeat
i:=i+1;
j:=s+a[i];
s:=s+j;
until i>=n+1;
write(j);
end.