//
//  main.cpp
//  sdo
//
//  Created by Catalina Brinza on 10/22/13.
//  Copyright (c) 2013 Catalina Brinza. All rights reserved.
//

#include <iostream>
#include  <fstream>
#include <cstdlib>
#include <ctime>
int k,a[3000000];

using namespace std;
    ofstream g("sdo.out");

void quicksort(int *a,int f,int n)
{
    int p,j,aux,i;
    if(f<n)
    {
        p=rand() % (n-f) + f;
        i=f;
        j=n;
        
        while(i<j){
            while(a[i]<=a[p]&&i<n)
                i++;
            while(a[j]>a[p])
                j--;
            if(i<j){
                aux=a[i];
                a[i]=a[j];
                a[j]=aux;
            }
        }
        
        aux=a[p];
        a[p]=a[j];
        a[j]=aux;
        if (k==j) {g<<a[j]; return;}
        else if (k<j) quicksort(a,f,j-1);
        else quicksort (a,j+1,n);
    }
    return;
}


int main()
{int n,i;
    ifstream f("sdo.in");
    f>>n>>k;
    for (i=0;i<n;i++) f>>a[i];
    quicksort(a,0,n);
    f.close();
    g.close();
    return 0;
}