#include<stdio.h>
#include<cstdlib>
int a[3000001],n,k;
void citire(){
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
}

int pivot(int i,int j){
	int p=a[i+(rand()%(j-i+1))];
	while(1){
		do{
			i++;
		}while(a[i]<p);
		
		do{
		j--;			
		}while(a[j]>p);
		if(i<j)
		a[i]=a[i]^a[j]^(a[j]=a[i]);
		else
			return j;
	}
}
void qsort1(int i,int j,int k){
	int p=pivot(i-1,j+1);
	if(k==p)
		return;
	else
	if(k>p)
		qsort1(p+1,j,k);
	else
		qsort1(i,p-1,k);
}

int main(){
	freopen("sdo.in","r",stdin);
	freopen("sdo.out","w",stdout);
	citire();
	qsort1(1,n,k);
	printf("%d",a[k]);
	return 0;
}