#include <iostream>
#include <fstream>

using namespace std;
int x[3000001],n,k;
ifstream f("sdo.in");
ofstream g("sdo.out");
void citire()
{
    f>>n>>k;
    for(int i=1;i<=n;i++)
    f>>x[i];
}
void QUICKSORT(int inf, int sup) {
  int m, i, j, t;
  i = inf;
  j = sup;
  m = x[(i + j) / 2];
  do {
    while ( (i < sup) && (x[i] < m) ) i++;
    while ( (j > inf) &&(x[j] > m) ) j--;
    if ( i<= j ) {
      t = x[i];
      x[i] = x[j];
      x[j] = t;
      i++;
      j--;
    }
  } while ( i <= j );
  if ( inf < j ) QUICKSORT(inf, j);
  if ( i < sup ) QUICKSORT(i, sup);
}
int main()
{
    citire();
    QUICKSORT(1,n);
    g<<x[k];
    return 0;
}