{Знайти найменше та найбўльшў числа в цўлочисельному масивў А[1..N],
якў можна подати сумамў елементив даного масиву(30 балўв)}
program suma;
label x;
const n=10;
      a: array[1..n] of integer=(3,11,14,12,23,44,88,44,42,100);
var i,j,k, max, r,m, su, mm, mmin, tem: integer; s: array[1..100] of integer;
    f: boolean;
procedure vpered;
begin
  j:=j+1;
  su:=su+a[j];
end;
procedure nazad;
begin
  su:=su-a[j];
  su:=su+a[j+1];
end;


begin
  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;
  f:=true;
  i:=1;
  while i<n do
    begin
      m:=a[i];
      j:=i+1;
      su:=a[j];
      while su>0 do
        begin
          if su=m then
                    begin
                      if f=true then mm:=su; f:=false;mmin:=su; goto x end
                  else
                     if (su<m) and (j<=n) then vpered
                     else begin nazad; if j<1 then break end;
       end;
    x:  i:=i+1;
    end;
  writeln('mm=',mm);
  writeln('mmin=',mmin);
end.