#include <fstream>
#include <queue>
using namespace std;

#define NMax 3000005

ifstream f("sdo.in");
ofstream g("sdo.out");

int v[NMax];
int n,k;
priority_queue<int> heap;

int main()
{
    f>>n>>k;
    int i;
    for(i=1;i<=n;++i) f>>v[i];
    for(i=1;i<=k;++i)
    {
        heap.push(v[i]);
    }
    for(i=k+1;i<=n;++i)
    {
        if(v[i] < heap.top())
        {
            heap.pop();
            heap.push(v[i]);
        }
    }
    g<<heap.top()<<"\n";

    f.close();
    g.close();
    return 0;
}