洛谷P873 砍树

洛谷P873 砍树

原题链接

#include "iostream"
#include "algorithm"
using namespace std;
 
int n,maxx,tree[1000001]={0};
 
bool check(int x) {
 long long sum=0;
 for(int i=0;i<n;i++){
     if(tree[i]>x)sum+=tree[i]-x;
 }
    return sum>=maxx;
}
 
int bsearch_2(int l, int r)
{
    while (l < r)
    {
        int mid = l + r + 1 >> 1;
        if (check(mid)) l = mid;
        else r = mid - 1;
    }
    return l;
}
int main(){
    cin>>n>>maxx;
    for(int i=0;i<n;i++)scanf("%d",tree+i);
    cout<<bsearch_2(*min_element(tree,tree+n), *max_element(tree,tree+n));
}