#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
int v[3000000],k,i,n;
void quick(int v[], int st, int dr)
{
    int i=st, j=dr, pivot=v[rand()%(dr-st+1)+st];
    while(i<=j)
    {
        while(v[i]<pivot)
            i++;
        while(v[j]>pivot)
            j--;
        if(i<=j)
        {
            int aux=v[i];
            v[i]=v[j];
            v[j]=aux;
            i++;
            j--;
        }
    }
    if(st<j)
        quick(v,st,j);
    if(i<dr)
        quick(v,i,dr);
}
int main()
{
    ifstream f("sdo.in");
    ofstream g("sdo.out");
    f>>n>>k;
    for(i=1;i<=n;i++)
        f>>v[i];
    quick(v,1,n);
    g<<v[k];
    return 0;
}