import java.util.Scanner;

public class Main{
    static Scanner sc = new Scanner(System.in);
    static int N = sc.nextInt();
    static int Q = sc.nextInt();
    static int[] nums = new int[N];
    static int[] tax = new int[N];
    public static void merge_sort(int[] nums,int l,int r){
        if(l >= r) return;
        int mid = (l + r) / 2;
        merge_sort(nums,l,mid);
        merge_sort(nums,mid + 1,r);
        int i = l,j = mid + 1,k = 0;
        while(i <= mid && j <= r){
            if(nums[i] <= nums[j]) tax[k++] = nums[i++];
            else tax[k++] = nums[j++];
        }
        while(i <= mid) tax[k++] = nums[i++];
        while(j <= r) tax[k++] = nums[j++];
        for(i = l,j = 0;i <= r;i++,j++) nums[i] = tax[j];
    }

    public static void main(String[] args){
        for(int i = 0;i <= N - 1;i++) nums[i] = sc.nextInt();
        merge_sort(nums,0,N - 1);
        System.out.print(nums[Q]);
    }
}