Cod sursă (job #546273)

program lanterna;
var
n, i, j, x:longword;
t, b:array[1..100000] of longword;
begin
assign(input, 'lanterna.in'); reset(input);
assign(output, 'lanterna.out'); rewrite(output);
readln(n);
for i:=1 to n do read(t[i]);
 for i:=2 to n do begin x:=t[i];
                        j:=i-1;
                        while (j>0) and (x<t[j]) do begin t[j+1] := t[j];
                                                          j:=j-1;
                                                          end;
                         t[j+1] := x;
                         end;

b[1]:=t[1];
b[2]:=t[2];
b[3]:=t[1]+t[2]+t[3];
for i:=4 to n do if (t[i]+t[1]+b[i-1]) > (b[i-2]+t[1]+2*t[2]+t[i]) then b[i]:=b[i-2]+t[1]+2*t[2]+t[i]
                                                                   else b[i]:=t[i]+t[1]+b[i-1];
writeln(b[n]);
close(output);
end.