#include <iostream>
using namespace std;
int n, k, a[5000001];
int main() {
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	for (int i = n; i > 0; i--) {
		for (int j = n; j > 0; j--) {
			if (a[j] < a[j - 1])
				swap(a[j - 1], a[j]);
		}
	}
	cout << a[k + 1];
	return 0;
}

求调QWQ