#include <bits/stdc++.h>

using namespace std;

ifstream fin("sdo.in");
ofstream fout("sdo.out");

void quicksort(int v[], int st, int dr) {
	if(st < dr) {
		int mid = (st + dr) / 2;
		int aux = v[st];

		v[st] = v[mid];
		v[mid] = aux;

		int i = st;
		int j = dr;
		int d = 0;

		while(i < j) {
			if(v[i] > v[j]) {
				aux = v[i];
				v[i] = v[j];
				v[j] = aux;
				d = 1 - d;
			}

			i = i + d;
			j = j - (1 - d);
		}

		quicksort(v, st, i - 1);
		quicksort(v, i + 1, dr);
	}
}

int main() {
	int n, k;
	fin >> n >> k;
	int v[50];

	for (int i = 0; i < n; i++)
		fin >> v[i];

	quicksort(v, 0, n - 1);
	fout << v[k - 1] << '\n';

	return 0;
}