#include <stdio.h>
#include <stdlib.h>
#define N 3000000

int v[N];

void swap(int *p1, int *p2)
{
    int aux = *p1;
    *p1 = *p2;
    *p2 = aux;
}

int part_2(int v[], int st, int dr)
{
    int p = st;
    for (int i = st; i < dr; i++)
    {
        if (v[i] <= v[dr])
        {
            swap(&v[p++], &v[i]);
        }
    }
    swap(&v[p], &v[dr]);
    return p;
}

void quick_sort(int v[], int st, int dr, int k)
{
    if (st >= dr)
    {
        return;
    }
    int p = part_2(v, st, dr);
    if (k < p)
    {
        quick_sort(v, st, p - 1, k);
    }
    if (k > p)
    {
        quick_sort(v, p + 1, dr, k);
    }
}

void shuffle(int v[], int n)
{
    for (int i = n - 1; i > 0; i--)
    {
        int r = rand() * rand();
        int p = r % (i + 1);
        swap(&v[i], &v[p]);
    }
}

int main()
{
    FILE *in, *out;
    in = fopen("sdo.in", "r");
    out = fopen("sdo.out", "w");
    int n, k;
    fscanf(in, "%d%d", &n, &k);
    k--;
    for (int i = 0; i < n; i++)
    {
        fscanf(in, "%d", &v[i]);
    }
    shuffle(v, n);
    /*
    for (int i = 0; i < n; i++)
    {
        fprintf(out, "%d ", v[i]);
    }
    fprintf(out, "\n");
    */
    quick_sort(v, 0, n - 1, k);
    /*
    for (int i = 0; i < n; i++)
    {
        fprintf(out, "%d ", v[i]);
    }
    fprintf(out, "\n");
    */
    fprintf(out, "%d\n", v[k]);
    fclose(in);
    fclose(out);
    return 0;
}