cf1201C

1024 节日快乐, 无奈感冒状态不好

- 给定一个数组(长度是奇数)

- 给定k次操作, 每次可以使得数组内的某个元素++

- 现问k次操作后, 数组的中位数最大是多少

>> face <<

前置技能 : 前缀和 + 二分

tutorial:先sort, 不难观察到整个答案和整个数组的前半部分没有关系, 于是我们可以想到从中间开始往上面二分高度

#include <bits/stdc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << "s" << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
const int maxn = 2e5 + 10;
vector<ll> a;
ll nxt()
{
	ll ret = 0;
	scanf("%d", &ret);
	return ret;
}
ll sum[maxn];
signed main()
{
	ll n = nxt(), k = nxt();
	a.push_back(0);
	_rep(i, 1, n)
	{
		ll tmp = nxt();
	
		a.push_back(tmp);
	}
	sort(a.begin() + 1, a.end());
	_rep(i, 1, n)
		sum[i] = a[i] + sum[i - 1];
	ll middle = n / 2 + 1;
	ll l = a[n / 2 + 1], r = l + k;
 	while (r > l)
	{
		ll mid = (l + r + 1) >> 1;
		ll pos = upper_bound(a.begin() + 1, a.end(), mid) - a.begin() - 1;
		if ( mid * (pos - middle + 1) - (sum[pos] - sum[middle - 1]) > k) {
			r = mid - 1;
		}
		else {
			l = mid;
		}
	}
	cout << l << endl;
}