program searchmin;
uses crt;
var
d : array[1..1000] of integer;
i,j,n,r : integer;
wmin: array[1..1000] of integer;
begin
writeln('ile elementow ma miec zbior?');
readln(n);
writeln('ile najmniejszych pokazac');
readln(r);
if r>n then
begin
writeln('r musi byc mniejsze od n');
break;
end
else
begin
for i:=1 to n do
begin
writeln('podaj elementy');
readln(d[i]);
end;
wmin[1] := d[1];
for i := 2 to n do
begin
for j:=1 to r do
begin
if (wmin[j] > d[i]) then
begin
wmin[j]:=d[i];
end;
end;
end;
for j:=1 to r do
writeln('wmin = ',wmin[j],' );
until n>r
readln;
end;
end.