#include <iostream>
#include <cstdio>
using namespace std;

int N,K,a[3000010];

int cnt(int nr){
    int res=0;
    for (int i=1; i<=N; i++)
        if (a[i]<nr) res++;
    return res;
}

int main(){
    freopen("sdo.in","r",stdin);
    freopen("sdo.out","w",stdout);
    scanf("%d %d",&N,&K);

    int i,l=1,r=1000000000,mid;
    for (i=1; i<=N; i++) scanf("%d",&a[i]);

    while (l<r){
        mid=(l+r)/2;
        if (cnt(mid)<K-1)
            l=mid+1;
        else if (cnt(mid)>K-1)
            r=mid-1;
        else
            r=mid;
    }

    int res=(1<<30);
    for (i=1; i<=N; i++)
        if (res-r>a[i]-r && a[i]>=r) res=a[i];

    printf("%d\n",res);

    return 0;
}