#include <iostream>
#include <cstdio>
#include <ctime>
#include <cstdlib>
#include <algorithm>
#define nmax 3000005
using namespace std;
int n,k,v[nmax];

int part(int a[],int st,int dr)
{
    int i= st , j= dr ;
    int p1= st+ rand()%(dr- st + 1);
    int p2= st+ rand()%(dr- st + 1);
    int p3= st+ rand()%(dr- st + 1);
    int p;
    if (p1 <= p3 && p3<=p2)
        p = p3;
    else
    if (p1 <= p2 && p2 <= p3)
        p = p2;
    else
        p = p1;
    swap(a[st],a[p]);

    while(1) {
        if (a[i]>a[j]) {
            swap(a[j],a[i+1]);
            swap(a[i],a[i+1]);
            i++;
        }
        else
            j--;
        if (i>=j)
            break;
    }
    return i;
}
int sel(int a[], int st, int dr, int k)
{
    if (st == dr)
        return  a[st];
    int q= part(a, st, dr);
    int t= q - st +1;
    if (t >= k)
        sel(a, st, q, k);
    else
        sel(a, q+1, dr, k-t);
}
int main()
{
    freopen("sdo.in","r",stdin);
    freopen("sdo.out","w",stdout);
    srand(time(NULL));
    scanf("%d %d", &n, &k);
    for (int i = 1; i<=n; i++)
        scanf("%d", &v[i]);

    //printf("%d",sel(v,1,n,k));
    nth_element(v+1,v+k,v+n+1);
    printf("%d",v[k]);
    return 0;
}