#include <iostream>
#include <climits>
#include <cstring>
#include <cassert>
#include <algorithm>

int partition(int arr[], int l, int r, int x) {
    int i;
    for (i = l; i <= r - 1; ++i) {
        if (x == arr[i]) {
            break;
        }
    }
    std::swap(arr[r], arr[i]);

    i = l;
    for (int j = l; j <= r - 1; ++j) {
        if (x <= arr[j]) {
            continue;
        } else {
            std::swap(arr[j], arr[i]);
            ++i;
        }
    }
    std::swap(arr[r], arr[i]);
    return i;
}

int findMedian(int arr[], int n) {
    std::sort(arr, arr+n);
    return arr[n/2];
}

int QuickSelect(int arr[], int left, int right, int k) {
    int size = right - left + 1;

    int i, median[(size + 4) / 5];
    for (i = 0; i < size / 5; i++) {
        median[i] = findMedian(arr + left + i * 5, 5);
    }
    // if there is sub_array in the end with len less that 5
    if (i * 5 < size) {
        median[i] = findMedian(arr + left + i * 5, size % 5);
        ++i;
    }

    int mediansOfMedians;
    if (i != 1) {
        mediansOfMedians = QuickSelect(median, 0, i - 1, i / 2);
    } else {
        mediansOfMedians = median[0];
    }

    int pos = partition(arr, left, right, mediansOfMedians);

    if (pos - left > k - 1) {
        return QuickSelect(arr, left, pos - 1, k);
    } else if (pos - left < k - 1) {
        return QuickSelect(arr, pos + 1, right, k - pos + left - 1);
    }
    return arr[pos];
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int n, k;
    std::cin >> n >> k;
    int* array = new int[n];
    for (int i = 0; i < n; ++i) {
        std::cin >> array[i];
    }

    std::cout << QuickSelect(array, 0, n - 1, k + 1);

    delete[] array;
    return 0;
}