#include <bits/stdc++.h>
const int N = 1E5+1;
using namespace std;
int n,a[N],i,k;
int main()
{{   cin>>n>>k;
for (int i =1 ;i<=n;i++)
    cin>>a[i];}
  {
    sort (a+1,a+n+1,greater<int>());
    cout << a[k];}
    return 0;
}

đây ạ

uses crt;
var  n,max,i,j:longint;
a,b,c:array[1..100000000] of longint;
begin
readln(n);
for i:=1 to n do                   begin
read(a[i]);inc(b[a[i]]);
if max<a[i] then max:=a[i];
end;readln;

i:=0;
repeat
inc(i);
if b[i]<>0 then begin
inc(j);
c[j]:=i;
end;
until i=max;
write(c[n]);
readln
end.