#include<iostream>
using namespace std;
int arr[5000005], k;
void qsort(int l, int r)
{
	int i = l, j = r, mid = arr[(l + r) / 2];
	do
	{
		while (arr[j] > mid)
			j--;
		while (arr[i] < mid)
			i++;
		if (i <= j)
		{
			swap(arr[i], arr[j]);
			i++;
			j--;
		}
	} while (i <= j);
	if (k <= j) qsort(l, j);
	else if (i <= k) qsort(i, r);
	else
	{
		cout<<arr[k];
		return;
	}
}
int main()
{
	int n;
	cin >> n >> k;
	for (int i = 0; i < n; i++)
	{
		cin >> arr[i];
	}
	qsort(0, n - 1);
}