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 i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
quick_sort(arr,0,arr.length-1);
System.out.println(arr[k-1]);
}
public static void quick_sort(int arr[],int left,int right) {
if(left>=right) {
return;
}
int l=left;
int r=right;
int temp =arr[left];
while(l!=r){
while(l<r&&arr[r]>=temp) {
r--;
}
while(l<r&&arr[l]<=temp) {
l++;
}
if(l<r) {
int s=arr[l];
arr[l]=arr[r];
arr[r]=s;
}
}
arr[left]=arr[l];
arr[l]=temp;
quick_sort(arr,left,l-1);
quick_sort(arr,l+1,right);
}
}