洛谷 P1873 砍树

最新推荐文章于 2024-01-05 13:08:31 发布

weixin_34241036

最新推荐文章于 2024-01-05 13:08:31 发布

阅读量128

点赞数

原文链接：http://www.cnblogs.com/Benjamin-cpp/p/10877694.html

版权

砍树

二分答案，难度较低。

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
//Mystery_Sky
//
#define M 10000100
#define ll long long 
#define INF 0x7f7f7f7f
ll l, r, mid;
int n, m, a[M];
inline bool check(ll ans)
{
    ll sum = 0;
    for(int i = 1; i <= n; i++) {
        if(a[i] > ans)  sum += (a[i] - ans);
    }
    return sum >= m;
}

int main() {
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
    l = 0, r = INF;
    while(l < r) {
        mid = (l + r + 1) / 2;
        if(check(mid)) l = mid;
        else r = mid - 1;
    }
    printf("%lld\n", l);
    return 0;
}

转载于:https://www.cnblogs.com/Benjamin-cpp/p/10877694.html