begin
clrscr;
randomize;

for i := 1 to n do
begin
a[i] := random(51);
write(a[i], ' ');
end;

max := a[1];
k := 2; {t.k. uslovie zadachi "preobarzovat' za odin prosmotr massiva", to}
{k ne mozhet bit' bol'she N, chem mi vospol'zuemsya v cikle}

for i := 2 to n do
begin
if k > n then break;
if a[i] <= max then {esli a[i] <= max to udalyaem etot element}
begin {i posiciyu I opyat' na tozhe mesto. Iz za}
for j := i to n - 1 do {etogo cikl mog bi ne viiti, no u nas est' K}
a[j] := a[j + 1];
dec(i);
end;
if a[i] > max then {proveryaem na maximum}
begin
max := a[i];
mi := i; {MI - poziciya maksimuma v massive}
end;
inc(k); {uvelichivaem K, k = [2..n]}
end;

write(#10#13, a[1], ' ');
for i := 2 to mi do
write(a[i], ' ');

readkey;
end.

Источник: