#include<iostream>
#include<fstream>
#include<ctime>
#include<cstdlib>
using namespace std;
int n, M[3000000],k;
ofstream g("sdo.out");
int alege_pivot(int left, int right)
{
    int p1,p2,p3,p,mini,maxi;
    p1=M[left + rand() % (right-left+1)];
    p2=M[left + rand() % (right-left+1)];
    p3=M[left + rand() % (right-left+1)];
    srand(time(NULL));
    if(p1<=p2&&p1<=p3)
        mini=p1;
    if(p2<=p1&&p2<=p3)
        mini=p2;
    if(p3<=p1&&p3<=p2)
        mini=p3;
    if(p1>=p2&&p1>=p3)
        maxi=p1;
    if(p2>=p1&&p2>=p3)
        maxi=p2;
    if(p3>=p1&&p3>=p2)
        maxi=p3;
    p=p1+p2+p3-maxi-mini;
    return p;

}
void quick_sort(int left, int right)
{
    int i=left, j=right, aux, pivot;
    pivot=alege_pivot(left, right);
    if(left<right)
    {
        while(i<=j)
        {
            while(M[i]<pivot)
                i++;
            while(M[j]>pivot)
                j--;
            if(i<=j)
            {
                aux=M[i];
                M[i]=M[j];
                M[j]=aux;
                i++;
                j--;
            }

        }
        if(k-1<=j)
            quick_sort(left, j);
            else
            quick_sort(i, right);
}
}
int main()
{
   ifstream f("sdo.in");
    f>>n>>k;
    for(int i=0;i<=n-1;i++)
        f>>M[i];
    quick_sort(0,n-1);
    g<<M[k-1];
}