P1873 [COCI 2011/2012 #5] EKO / 砍树(二分答案)

P1873 砍树
二分答案（即锯片高度）然后减去可以获得的木材长度与已知的木材总长度进行比较。

• 每次累加获得木材的长度获得的和会爆int所以不开longlong，*** 要开longlong

#include <iostream>
#include <cstdio>
#include <map>
#include <algorithm>
#define rep(n) for(int i = 1; i <= n; i ++)
using namespace std;

typedef long long ll;
const int N = 1000010;
const int INF = 1000000000;
ll n, m;
ll a[N];
ll ans;

bool check(int x)
{
    ll res = 0;
    rep(n) if(a[i] > x)res += (a[i] - x);
    return res >= m;
}
int main()
{    
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    rep(n) cin >> a[i];
    int l = 1, r = INF;
    while(l < r)
    {
        int mid = l + r + 1 >> 1;
        if(check(mid)) l = mid;
        else r = mid - 1;
    }
    cout << l;
    return 0;
}