#include <iostream> #include <thread> #include <vector> #include <mutex> #include <string> #include <algorithm> using namespace std; int cmp(const void* a, const void* b) { return ((*(double*)a - *(double*)b > 0) ? 1 : -1); } double a[1000001]; int main() { int n, i, j, h, g; double m; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%lf", &a[i]); } qsort(a, n, sizeof(a[0]), cmp); if (n % 2 == 0) { m = a[n / 2 - 1]; h = int(m); if (m >= double(h)) h = h + 1; } else { m = a[n / 2]; h = int(m); if (m >= double(h)) h = h + 1; } printf("%d", h); }