#include <stdio.h>

int Partition(int a[],int low,int high){
	a[0]=a[low];
	while(low<high){
		while(low<high&&a[high]>a[0]) high--;
		a[low]=a[high];
		while(low<high&&a[low]<a[0]) low++;
		a[high]=a[low];
	}
	a[low]=a[0];
	return low;
}

void Qsort(int a[],int low,int high){
	if(low<high){
		int pivotloc=Partition(a,low,high);
		Qsort(a,pivotloc+1,high);
		Qsort(a,low,pivotloc-1);
	}
}
int main(){
	int n,m;
	scanf("%d %d",&n,&m);
	int a[5000005];
	int i;
	for(i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	Qsort(a,1,n);
	printf("%d",a[m+1]);
	return 0;
}