#include <iostream>
#include <fstream>

using namespace std;

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

int v[3000001];

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

int main()
{
    int n, k, i, nr_distincte;

    fin >> n >> k;
    for(i = 1; i <= n; i++)
        fin >> v[i];

    QuickSort(1,n);

    i = 2;
    nr_distincte = 1;
    while(nr_distincte < k)
    {
        if(v[i] != v[i-1])
            nr_distincte++;
        i++;
    }

    fout << v[i-1];

    return 0;
}