problem

solution

• 考虑贪心，肯定最先给最小的值加，加到跟次小一样，再给次小的加。。。
• 先sort，相邻对比，把坑补上，补不上跳出

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const double pi = acos(-1);
const int maxn = 1e5+10;
LL a[maxn];
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    LL n, k;  cin>>n>>k;
    for(int i = 1; i <= n; i++)cin>>a[i];
    sort(a+1,a+n+1);
    LL ans = a[1]+k;
    for(LL i = 1; i < n; i++){
        if(k > (a[i+1]-a[i])*i){
            k -= (a[i+1]-a[i])*i;
            ans = a[i+1]+k/(i+1);
        }else{
            ans = a[i]+k/i;
            break;
        }
    }
    cout<<ans<<"\n";
    return 0;
}