#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int v[500001];
void QuickSort(int v[],int st, int dr)
{
	if(st>=dr)
    {
       return;
    }
	int mijloc,i,j,pivot=v[rand()%(dr-st)+st];
    i=st;
    j=dr;
    mijloc=(j+i)/2;
    while(i<=j)
    {
        while(v[i]<pivot)
        {
            i++;
        }
        while(v[j]>pivot)
        {
            j--;
        }
        if(i<=j)
        {
            swap(v[i],v[j]);
            i++;
            j--;
        }
    }
	QuickSort(v,st,j);
    QuickSort(v,i,dr);
}
int main()
{
    srand(time(NULL));
    int n,i,k;
    ifstream fin("sdo.in");
    ofstream fout("sdo.out");
    fin>>n>>k;
    for(i=0;i<=n-1;i++)
    {
        fin>>v[i];
    }
    QuickSort(v,0,n-1);
    fout<<v[k-1];
    return 0;
}