提出 #58285054

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()

int main() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);

    ll N, M, K;
    cin >> N >> M >> K;
    vector<pair<ll, int>> A(N);
    vector<ll> ans(N);
    rep(i, 0, N){
        cin >> A[i].first;
        A[i].second = i;
    }
    sort(all(A));
    reverse(all(A));
    vector<ll> sumA(N + 1);
    rep(i, 0, N) sumA[i + 1] = sumA[i] + A[i].first;
    if (N == M){
        rep(i, 0, N){
            cout << 0 << (i + 1 == N ? "\n" : " ");
        }
        return 0;
    }
    ll rem = K - sumA.back();
    ll ind = M - 1;
    ll val = -1;
    auto f = [&](ll i, ll j) -> ll {
        ll res = A[j].first * (M + 1 - j);
        res -= sumA[M] - sumA[j] + A[i].first;
        return res - 1;
    };
    for (ll i = N - 1; i >= M; i--){
        while (ind != 0){
            if (f(i, ind - 1) >= rem) break;
            ind--;
        }
        val = A[ind].first;
        val += (rem - f(i, ind)) / (M + 1 - ind);
        ans[A[i].second] = val - A[i].first;
    }
    rep(i, 0, M) ans[A[i].second] = val - A[i].first;
    rep(i, 0, N){
        if (ans[i] < 0) ans[i] = 0;
        if (ans[i] > rem) ans[i] = -1;
        cout << ans[i] << (i + 1 == N ? "\n" : " ");
    }
}

提出情報

ジャッジ結果