Отсортировать массив и вывести элементы массива, которые встречаются ровно K раз

program z1;
var 
  a, b, ans : array[1..10007] of integer;
  n, k, i, j, cnt, size, ans_size : integer;
 
function has(x : integer) : integer;
var res, ii : integer;
begin
  res := 0;
  for ii := 1 to size - 1 do begin
    if(b[ii] = x) then begin res := 1; break; end;
  end;
  has := res;
end;
 
begin
  readln(n);
  size := 1;
  ans_size := 1;
  for i := 1 to n do read(a[i]);
  readln(k);
  
  for i := 1 to n do begin
    if(has(a[i]) = 0) then begin
      cnt := 1;
      for j := i + 1 to n do if(a[j] = a[i]) then cnt := cnt + 1;
      if(cnt = k) then begin
        ans[ans_size] := a[i];
        ans_size := ans_size + 1;
      end;
      b[size] := a[i];
      size := size + 1;
    end;
  end;
  
  ans_size := ans_size - 1;
  if(ans_size = 0) then writeln(0) else begin
    for i := 1 to ans_size do write(ans[i], ' ');
  end;
end.

var
  n, k, i, j, t: integer;
  a: array[1..10001] of integer;
  f: boolean;
begin
  read(n); 
  for i := 1 to n do read(a[i]); 
  read(k);
  for i := 1 to n - 1 do
    for j := i + 1 to n do
      if a[i] > a[j] then 
      begin
        t := a[i]; 
        a[i] := a[j];
        a[j] := t;
      end;
  i := 1;
  f := false;
  repeat
    j := i + 1;
    while (a[i] = a[j]) and (j <= n) do inc(j);
    if j - i = k then 
    begin
      writeln(a[i]);
      f := true;
    end;
    i := j;
  until j > n;
  if not f then write(0)
end.