#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
void quicksort(int a[],int left,int right){
	int l = left;
	int r = right;
	int base = a[(l+r)/2];
	while(l<=r){
		while(a[l]<base) l+=1;
		while(a[r]>base) r-=1;
		if(l<=r){
			swap(a[l],a[r]);
			l+=1;
			r-=1;
		}
	}
	if(r>=left) quicksort(a,left,r);
	if(right>=l) quicksort(a,l,right); 
}
int arr[5000005] = {};
int main(){
	int n,k;
	cin >> n >> k;
	for(int i=0;i<n;i++){
		scanf("%d",&arr[i]);
	}
	quicksort(arr,0,n-1);
	cout << arr[k];
	return 0;
}