#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;

ifstream in("sudest.in");
ofstream out("sudest.out");

int part(int v[], int st, int dr)
{
    int pivot = v[dr];
    int poz = st;
    for (int i = st; i < dr; i++)
        if (v[i] < pivot)
        {
            int aux = v[i];
            v[i] = v[poz];
            v[poz] = aux;
            poz++;
        }
    v[dr] = v[poz];
    v[poz] = pivot;
    return poz;
}

void quickSort(int v[], int st, int dr,int k)
{
    if (st < dr)
    {
        int poz = part(v,st,dr);
        if (poz == k)
            return;
        else
        {
            quickSort(v, st, poz - 1,k);
            quickSort(v, poz + 1, dr,k);
        }
    }
}

int v[3000001];
int main()
{
    int n,k;
    cin >> n>>k;
    for (int i = 1; i <= n; i++)
        cin >> v[i];
    quickSort(v,1,n,k);
    cout << v[k];
    return 0;
}