#include<bits/stdc++.h>
using namespace std;
int a[5000010],n,k;
int search(int low,int high){
	 int mid,l=low,r=high,tmp;
	 mid=a[(low+high)/2];
	 while(l<r){
	 	while(mid>a[l])l++;
	 	while(mid<a[r])r--;
	 	if(l<=r){
	 		tmp=a[l];
	 		a[l]=a[r];
	 		a[r]=tmp;
	 		l++;
	 		r--;
		 }
	 }
	 if(a[k]==mid)return mid;
	 else if(a[k]<mid)search(low,r);
	 else search(l,high); 
}
int main(void){
	cin>>n>>k;
	for(int i=0;i<n;i++)scanf("%d",&a[i]);
	cout<<search(0,n-1);
	return 0; 
}