#include <iostream> using namespace std; const int MAXN = 1000; int n, i, lbound, rbound, mid, m, count; int x[MAXN]; int main( ) { cin >> n >> m; for (i = 0; i < n; i++) cin >> x[i]; lbound = 0; rbound = m; while (1) { mid = (lbound + rbound) / 2; 2; for (i = 0; i < n; i++) if (3) 4; if (count > n / 2) lbound = mid + 1; else 5; } cout << rbound << endl; return 0; }