include [HTML_REMOVED]
const int N = 100000005;
int arr[N];
void quicksort(int a[], int left, int right)
{
int i = left, j = right;
int middle = a[(left + right) / 2];
do
{
while (a[i] < middle && i < right)
i;
while (arr[j] > middle && j > left)
j–;
if (i <= j)
{
int itemp = a[i];
a[i] = a[j];
a[j] = itemp;
i;
j–;
}
} while (i <= j);
if (i < right) quicksort(a, i, right);
if (j > left) quicksort(a, left, j);
}
int main()
{
using namespace std;
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> arr[i];
quicksort(arr, 0, n - 1);
cout << arr[k - 1] << endl;
return 0;
}