#include <fstream>

using namespace std;

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

int a[3000000],n;

void quicksort(int st, int dr)
{
      int i = st, j = dr;
      int aux;
      int p = a[(st+dr) / 2];
      while(i <= j)
      {
            while(a[i] < p)
                i++;
            while(a[j] > p)
                j--;
            if(i <= j)
            {
                  aux = a[i];
                  a[i] = a[j];
                  a[j] = aux;
                  i++;
                  j--;

            }
      }
      if(st < j)
            quicksort(st, j);
      if(i < dr)
            quicksort(i, dr);
}

int main()
{
    int i,k;
    in >> n >> k;
    for(i = 1 ; i <= n ; i++)
        in >> a[i];
    quicksort(1,n);
    out << a[k];
    return 0;
}