#include <stdio.h>
#include <stdlib.h>
int tab[3000000];

void quick_sort( int l , int r )
{
    int i , j;
    int x , aux;
    i = l;
    j = r;
    x = tab[ ( i + j ) / 2 ];
    do
    {
        while ( tab[ i ] < x )
            i++;
        while ( tab[ j ] > x )
            j--;
        if ( i <= j )
        {
            aux = tab[ i ];
            tab[ i ] = tab[ j ];
            tab[ j ] = aux;
            i++;
            j--;
        }
    } while ( i <= j );
    if ( l < j )
        quick_sort( l , j );
    if ( r > i )
        quick_sort( i , r );
}




int main()
{
    int n,m,i,j,aux;

    freopen("sdo.in","r",stdin);
    freopen("sdo.out","w",stdout);

    scanf("%i",&n);
    scanf("%i",&m);
    for(i=0;i<n;i++)
    scanf("%i",&tab[i]);
quick_sort( 0 , n-1 );

    printf("%i",tab[m-1]);

    return 0;
}