#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n,k;

void quickSort(vector<int>&q,int l ,int r){
    if(l >=r )return;
    int x = q[(l+r)>>1],i = l-1, j = r+1;
    while(i<j){
        do i++; while(q[i]<x);
        do j--; while(q[j]>x);
        if (i<j) swap(q[i],q[j]);
    }
    quickSort(q,l,j);
    quickSort(q,j+1,r);
}
int main(){
    scanf("%d %d",&n,&k);
    vector<int> q(n);
    for(int i=0;i<n;i++)
    scanf("%d",&q[i]);
    quickSort(q,0,n-1);
    printf("%d",q[k-1]);
    return 0;
}