0分求调

#include <iostream>
using namespace std;
int n,k,a[500001],ans,l,r;
bool check(int mid){
    int t=0;
    for (int i=1;i<=n;i++){
        t+=mid-a[i];
    }
    if (t<=k*mid){
        return 1;
    }
    return 0;
}
int main(){
    cin>>n>>k;
    for (int i=1;i<=n;i++){
        cin>>a[i];
    }
    l=0,r=n;
    while (l<r){
        ans=(l+r)>>1;
        if (check(ans)){
            r=ans-1;
        }else{
            l=ans;
        }
    }
    cout<<ans;
    return 0;
}