#include<bits/stdc++.h>
using namespace std;
int arr[5000005],k;
void quicksort(int left,int right){
    int i = left;int j = right;int base = (i+j)/2;
    int tem;
    while(i<=j){
        while(arr[i]<arr[base]) i++;
        while(arr[j]>arr[base]) j--;
        if(i<=j){
            swap(arr[i],arr[j]);
            i++;
            j--;
        }
    }
    if(k<=j) quicksort(left,j);
    else if(k>=i) quicksort(i,right);
    else {
        cout<<arr[j+1];
        exit(0);
    }
}

int main()
{
	int n;
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++)
		scanf("%d",&arr[i]);
	quicksort(0,n-1);
}