#ifndef RECURSION11_H_
#define RECURSION11_H_

#include <iostream>
#include <algorithm>

using namespace std;

int solve(int n, int arr[], int k);

int median(int arr[], int sz) {
	int m = sz / 2;
	nth_element(arr, arr + m, arr + sz);
	return arr[m];
}

int main() {
  int n, k;
  cin >> n >> k;

  int* arr = new int[n];
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
  }

  cout << solve(n, arr, k) << "\n";
}

#endif // RECURSION11_H_