import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int k=sc.nextInt();
int[] arr = new int[n];
for (int a=0;a<arr.length;a++){
arr[a]= sc.nextInt();
}
quickSort(arr,0,n-1);
System.out.print(arr[k-1]);
}
public static void quickSort(int[] q,int l,int r){
if(l>=r)return;
int i = l-1, j = r+1, x = q[l+r>>1];
while(i<j){
do i++; while(q[i]<x);
do j--; while(q[j]>x);
if(i<j){
int tmp = q[i];
q[i]=q[j];
q[j]=tmp;
}
}
quickSort(q,l,j);
quickSort(q,j+1,r);
}
}