#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;

int cmp1(const void *a, const void* b){
	if (*(int*)a > *(int*)b){
		return 1;
	}
	return -1;
}
int V[3000000];
int main(){
	ifstream f("sdo.in");
	ofstream o("sdo.out");
	int n = 0, k = 0;
	f >> n >> k;
	for (int i = 0; i < n; i++){
		f >> V[i];
	}
	qsort(V, n, sizeof(int), cmp1);
	o << V[k - 1];
	return 0;
}