#include <bits/stdc++.h>
using namespace std;
int a[100001];
void mysort(int left,int right)
{
    if(left >= right) return;
    int i=left,j=right,flag=a[(left+right)/2],tmp;
    do
    {
        while (a[i] < flag)i++;
        while (a[j] > flag)j--;
        if(i <= j) tmp=a[i],a[i]=a[j],a[j]=tmp,i++,j--;
    } while (i <= j);
    if(left < j)mysort(left,j);
    if(i < right)mysort(i,right);
}
int main()
{
    int n,k;
    cin >> n >> k;
    for(int i=0;i<n;i++)
        cin >> a[i];
    mysort(0,n-1);
    cout << a[k];
    return 0;
}