#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <bitset>
#include <stack>
#include <queue>
#include <deque>

using namespace std;

#ifdef LOCAL
ifstream fin("input.txt");
#define fout cout
#else
ifstream fin("sdo.in");
ofstream fout("sdo.out");
#endif

const int NMAX = 3e6+5;

int n, k, a[NMAX];

int main() {
	fin >> n >> k;
	for (int i = 1; i <= n; i++)
		fin >> a[i];
	nth_element(a + 1, a + k, a + n + 1);
	fout << a[k];
	return 0;
}