#include<iostream>
#include<fstream>
using namespace std;
 void quickSort(long long arr[3000001], long long left, long long right)
 {
  long long i = left, j = right;
  long long tmp;
  long long pivot = arr[(left + right) / 2];
 
   
  while (i <= j) {
        while (arr[i] < pivot)
              i++;
        while (arr[j] > pivot)
              j--;
        if (i <= j) {
              tmp = arr[i];
              arr[i] = arr[j];
              arr[j] = tmp;
              i++;
              j--;
    }
}
 
if (left < j)
    quickSort(arr, left, j);
if (i < right)
        quickSort(arr, i, right);
}
 
int main()
{ifstream f("sdo.in");
ofstream g("sdo.out");
long long n,k,i,v[3000001];
f>>n>>k;
for(i=1;i<=n;i++)
    f>>v[i];
quickSort(v,1,n);
g<<v[k];
g<<"\n";
f.close();
g.close();
return 0;
}