③
if heap [i] > heap [j] then
begin
④
i: = j
end
else
break;
end;
end;
begin
readln (n, m) ;
for i := 1 to n do
read (value [i] ) ;
r := 0;
for i := 1 to m do
begin
opt [il := value [i] ;
add (i) ;
end;
for i := m + 1 to n do
begin
opt[i] := ⑤
remove ( ⑥ )
add (i) ;
end;
writeln (heap [1] ) ;
end.
21
