#include<bits/stdc++.h>
using namespace std;

int n,k,a[5000005],lena=0;

void sorts(int starts,int ends)
{
	if(starts==ends)return;
	int mid=(starts+ends)/2;
	sorts(starts,mid);
	sorts(mid+1,ends);
	int b[ends-starts+5],i=1,j=mid+1,lenb=0;
	while(i<=mid&&j<=ends)
	{
		if(a[i]<=a[j])b[++lenb]=a[i++];
		else b[++lenb]=a[j++];
	}
	while(i<=mid)b[++lenb]=a[i++];
	while(j<=ends)b[++lenb]=a[j++];
	for(int i=starts,j=1;i<=ends,j<=lenb;++i,++j)a[i]=b[j];
}

int main()
{
    scanf("%d%d",&n,&k);
    ++k;
    for(int i=1;i<=n;++i)scanf("%d",&a[i]);
    sorts(1,n);
    printf("%d ",a[k]);
    return 0;
}

想归并偷鸡