感觉跟官解做法是一样的啊

已 define int long long，assert 也没有问题

constexpr int N = 2e5 + 5;
int n, k, a[N];
 
void mian() {
    cin >> n >> k;
    rep(i, 1, n) cin >> a[i];
    sort(a + 1, a + n + 1);
    int l = 0, r = 1e18;
    while(l < r) {
        int mid = (l + r + 1) >> 1;
        int res = 0;
        rep(i, 1, n) if(a[i] < mid) res += mid - a[i];
        if(res <= k) l = mid;
        else r = mid - 1;
    }
    rep(i, 1, n) if(a[i] < l) 
        k -= l - a[i], a[i] = l;
    int cnt = count(a + 1, a + n + 1, a[1]);
    assert(k >= 0 && k < cnt);
    assert(is_sorted(a + 1, a + n + 1));
    cnt -= k;
    cout << n * a[1] + n - cnt - n + 1 << endl;
    rep(i, 1, n) a[i] = 0;
}