#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

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

int main()
{
	priority_queue <int, vector<int>, greater<int>> coada;

	int n, k, el;

	fin >> n >> k;

	for (int i = 0; i < n; i++)
	{
		fin >> el;

		coada.push(el);
	}

	int i = 1;

	while (!coada.empty())
	{
		if (i == k)
		{
			fout << coada.top();

			fin.close();

			fout.close();

			return 0;
		}

		i++;

		coada.pop();
	}

	return 0;
}