{Знайти найменше та найбўльшў числа в цўлочисельному масивў А[1..N],
якў можна подати сумамў елементив даного масиву(30 балўв)}
program suma;
const n=6;
      a: array[1..6] of integer=(3,15,12,14,888,444);
var i,j,k, max, r,m, su: integer; s: array[1..100] of integer;

procedure vpered;
begin
  j:=j+1;
  su:=su+a[j];writeln('vper',a[j]);
end;
procedure nazad;
begin
  j:=j-1;
  su:=su-a[j];  writeln('vid',a[j]);
  su:=su+a[j+1];writeln('dod',a[j+1]);
  if j+1<=n then vpered else begin j:=j-1; nazad; end;
end;


begin
  writeln; writeln;
  for i:=1 to n-1 do
    begin
      max:=a[i]; k:=i;
      for j:=i+1 to n do
        if a[j]>max then begin max:=a[j]; k:=j end;
      r:=a[i];
      a[i]:=max;
      a[k]:=r;
    end;

  for i:=1 to n do
    write(a[i],' ');
  writeln;
  writeln;

  i:=1;
  while i<n do
    begin
      m:=a[i];
      writeln('m',m);
      j:=i+1;
      su:=a[j];
      while su>0 do
        begin
          if su=m then begin writeln(m); halt end
          else
          if (su<m) and (j<n) then vpered else begin nazad; if j<1 then break end;
       end;
      i:=i+1;
    end;
end.