. Определи сумму двух наибольших элементов массива arr.

Программа:

Pascal:

const arr: array[1..10] of integer = (-5, 2, 4, -6, 12, 10, -3, 12, 15, 2);

var max1, max2: integer;

begin

 max1 := arr.max;

 max2 := -MAXINT;

 for var i := 1 to 10 do

   if (arr[i] > max2) and (arr[i] <> max1) then max2 := arr[i];

 writeln(arr, #10, max1 + max2);

end.

11000 (2) = 30 (8) = 18 (16) = 24 (10)

100111 (2) = 47 (8) = 27 (16) = 39 (10)

10100011 (2) = 243 (8) = а3 (16) = 163 (10)

101010101010 (2) = 5252 (8) = (16) = 2730 (10)

var  s: string;   i: longint; begin  readln(s);   for i: =length(s) downto 1 do  begin  if s[i]=' ' then delete(s,i,1);   if (s[i]> ='1')and(s[i]< ='9') then delete(s,i,1);   end;   writeln(length(s)); end.