#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("sdo.in");
ofstream g ("sdo.out");
long k,n,v[3000001];
void quicksort(long x[], long left, long right)
{
    long i=left,j=right;
    long aux;
    long pivot=x[(left+right)/2];
    while (i<=j)
      {
          while (x[i]<pivot)
            i++;
          while (x[j]>pivot)
            j--;
          if (i<=j)
          {
              aux=x[i];
              x[i]=x[j];
              x[j]=aux;
              i++;
              j--;
          }

      }
      if (left<j&& j<=k)
            quicksort(x,left,j);
      if (right>i&& right<=k)
            quicksort(x,i,right);
}

int main()
{
    long i;
    f>>n>>k;
    for (i=1;i<=n;i++)
        f>>v[i];
    quicksort(v,1,n);
    g<<v[k];
    f.close();g.close();
    return 0;
}