#include<iostream>
#include<fstream>
#include<algorithm>

using namespace std;

void quicksort(int V[], int inceput, int sfarsit){
	if (sfarsit - inceput > 0){
		int pivot = V[rand() % sfarsit];
		int i = inceput;
		int j = sfarsit;

		while (i <= j){
			while (V[i]<pivot)
			{
				i++;
			}
			while (V[j]>pivot){
				j--;
			}

			if (i <= j){
				swap(V[i], V[j]);
				i++;
				j--;
			}
		}
		quicksort(V, inceput, j);
		quicksort(V, i, sfarsit);
	}
}
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];
	}
	nth_element(V, V + k - 1, V + n);
	o << V[k - 1];
	return 0;
}