#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
using namespace std;
 struct compara
    {
        bool operator () (int x, int y)
            {
                return x>y;
            }
    };
    priority_queue <int, vector <int>, compara>q;
int main()
{
    ifstream f("sdo.in");
    ofstream g("sdo.out");

    int n,k;
    f>>n>>k;
    for (int i=1; i<=n; i++)
    {
        int p;
        f>>p;
        q.push(p);
    }
    for (int i=1; i<k; i++)
        q.pop();
    cout<<q.top();
    return 0;
}