#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

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

priority_queue <int> q;

int n,k,x;

int main() {
    int i;
    f>>n>>k;
    if (k <= n /2) {
        for(i = 1; i <= n; ++i) {
            f>>x;
            x = -x;
            q.push(x);
        }
        for(i = 1; i < k; ++i) {
            q.pop();
        }
        g<<-q.top();
    }
    else {
        for(i = 1; i <= n; ++i) {
            f>>x;
            q.push(x);
        }
        for(i = 1; i <= n - k; ++i) {
            q.pop();
        }
        g<<q.top();
    }
    return 0;
}