#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <ctime>
#include <cassert>
using namespace std;

#define PRO "sdo"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		freopen("test.out","w",stdout);
	}
}

#define MAX 3000002
#define MOD 1000003
#define INF 0xffffff
#define EPS 1E-8

int n,k,a[MAX];

void qsort(int l,int r)
{
	srand(time(0));
	int p = a[l+rand()%(r-l+1)],i=l,j=r;
	while(i<j)
	{
		while(a[i] < p)i++;
		while(a[j] > p)j--;
		if(i <= j)
		{
			swap(a[i],a[j]);
			i++;
			j--;
		}
	}
	if(i<=k && i<r)qsort(i,r);
	if(j>l)qsort(l,j);
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);
	// start
		scanf("%d %d",&n,&k);
		for(int i=1;i<=n;i++)
			scanf("%d",&a[i]);
		qsort(1,n);
		/*for(int i=1;i<=n;i++)
			printf("%d ",a[i]);*/
		printf("%d\n",a[k]);
	return 0;
}