#include <iostream>
#include <fstream>

using namespace std;

void QuickSort(int v[], int st, int dr)
{
	if(st < dr)
	{
		int m = (st + dr) / 2;
		int aux = v[st];
		v[st] = v[m];
		v[m] = aux;
		int i = st , j = dr, d = 0;
		while(i < j)
		{
			if(v[i] > v[j])
			{
				aux = v[i];
				v[i] = v[j];
				v[j] = aux;
				d = 1 - d;
			}
			i += d;
			j -= 1 - d;
		}
		QuickSort(v, st , i - 1);
		QuickSort(v, i + 1 , dr);
	}
}

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

int main()
{
    int n, k;
    fin >> n >> k;
    // int v[50];
    int* v = new int[n];
    for (int i=0; i<n; i++) fin >> v[i];
    fin.close();
    QuickSort(v, 0, n-1);
    fout << v[k-1] << endl;
    fout.close();
    return 0;
}