
program heapsort;

const n=40;

var a: array [1..n] of integer;

procedure swap (var a, b: integer);
var t : integer;
begin
     t := a;
     a := b;
     b := t;
end;

procedure heapify (i, k : integer);
var j: integer;
begin
  while 2*i<=k do begin
    j:=2*i;
    if j+1<=k then
       if a[j] a[i+1]then
         ok:=false;
    if not ok then
         writeln('Chyba');

  end;

begin
     fill;
     print;
     sort;
     print;
     check;
     readln;
end.