Help plz...

Here is my code:

var a : array [1..101] of longint;
    n, i, j : longint;
    t, max : extended;
begin
   readln(n);
   for i := 1 to n do
      readln(a[i]);
   for i := 1 to n do
      for j := i+1 to n do
         begin
            t := 2 * sqrt(a[i]*a[j]);
            if t>max then max := t;
         end;
   writeln(max:0:2);
end.

Probably you don't understand the problem.
There are N stripies.
They collide until only one left.
We should minimize its weight.
Example:
72,30,50 -> 120,30 -> 120

oh, i really didn't understand it... thanx