#include<iostream>
#include<stdlib>
#include<fstream>

using namespace std;

ifstream f("sdo.in");
	ofstream g("sdo.out");


long arr[3000001],n,k;

void quickSort( long left, long right)
 {
  long i = left, j = right;
  long tmp;
  long pivot = arr[left + rand() % ( right - left + 1 )];
  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 (k<=j)
    quickSort( left, j);
else
        quickSort( i, right);
}
int main()
{
	
	long i;
	f>>n>>k;
	for(i=1;i<=n;i++)
		f>>arr[i];
	quickSort(1,n);
	g<<arr[k];
	f.close();
	g.close();
	return 0;
}