#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 3000005;

int n, k, i, a[nmax];

int main()
{
    freopen("sdo.in", "r", stdin);
    freopen("sdo.out", "w", stdout);

    scanf("%d%d", &n, &k);

    for(i = 1; i <= n; i++)
        scanf("%d", &a[i]);

    nth_element(a + 1, a + k, a + n + 1);

    printf("%d\n", a[k]);

    return 0;
}