//#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <set>
#include <algorithm>
#include <bitset>
#include <time.h>
#include <tuple>
#include <fstream>
#include <iomanip>
#include <utility>

#pragma warning "da 100% din tine. :)"
#define nl '\n'
#define sp ' '
#define pb(x) push_back(x)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define SIZE 3000
#define NR 105
#define N 11
#define INF 10000
#define ll long long
#define ull unsigned ll

using namespace std;
ifstream cin("sdo.in");
ofstream cout("sdo.out");

template<class v, class type>
void print(v Vector, type nr) {
    for_each(all(Vector), [](type x) {
        cout << x;
    });
}

double logXBaseY(ll X, ll Y) {
    return log2(X) / log2(Y);
}

long long exp_log(long long x, long long n) {
    long long int r = 1;
    while (n) {
        if (n & 1)
            r = (1LL * r * x);
        x = (1LL * x * x);
        n /= 2;
    }
    return r;
}

void nimic() {
    return;
}

int arr[3000000];
int n, k, z;

void quick(int st, int dr) {
    if (st >= dr)
        return;
    int mid = (st + dr) / 2;
    int pv = arr[mid];
    int i = st, j = dr;
    while (i <= j) {
        while (arr[i] < pv)++i;
        while (arr[j] > pv)--j;
//        if(i<=j)
//            swap(arr[i++], arr[j--]);
        i <= j ? swap(arr[i++], arr[j--]) : nimic();
    }
    if (k <= j)
        quick(st, j);
    else quick(i, dr);
}

int main() {
    ios_base::sync_with_stdio(false);
//    freopen("caps.in", "r", stdin);
//    freopen("caps.out", "w", stdout);
    clock_t tStart = clock();
    cin >> n >> k;
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    quick(0, n - 1);
    cout << arr[k-1];
//        printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}