import java.io.*;

import java.util.*;

public class Main {
	
		
	public static void main(String[] args) {
	  Scanner sc = new Scanner (System.in);
	  int n =sc.nextInt();
	  int k = sc.nextInt();
	  int[] s = new int[n];
	  for(int i = 0;i<s.length;i++)
	  {
		  s[i] = sc.nextInt();
	  }
	  quickSort(s , 0 , s.length-1);
	 System.out.println(s[k]);

}
	
	public static  void quickSort(int[] arr,int low ,int high) {
		int i ,j,temp,t;
		if(low>high) {
			return;
		}
		i = low;
		j = high;
		temp = arr[low];
		
		while(i <j) {
			while(temp <= arr[j] && i<j) {
				j--;
			}
			while(temp>=arr[i] && i<j)
			{
				i++;
			}
			if(i<j) {
				t = arr[j];
				arr[j] = arr[i];
				arr[i] = temp;
			}
			
		}
		arr[low] = arr[i];
		arr[i] = temp;
	   quickSort(arr,low,j-1);
	   quickSort(arr,j+1,high);
	}
	}