洛谷 P1873. EKO / 砍树
原题链接
中等
作者:
我是java同学
,
2024-01-09 20:31:35
,
所有人可见
,
阅读 42
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1000010;
int n, m;
int h[N];
bool check(int mid) {
LL res = 0;
for (int i = 0; i < n; i ++ )
if (h[i] > mid)
res += h[i] - mid;
return res >= m;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i ++ )
scanf("%d", &h[i]);
int l = 0, r = 4e5;
while (l < r) {
int mid = l + r + 1 >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
cout << r << endl;
return 0;
}