提出 #72482456

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;

int n, m, k;
ll a[N];
priority_queue<array<ll, 4>> _S; // val, c, cur, pre
void solve() {
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + 1 + n, greater());
    _S.push({a[1] * m, 2, 0, m});
    while(k > 0) {
        auto [val, c, cur, pre] = _S.top(); _S.pop();
        cout << val << endl;
        k--;

        if(m > 0) {
            if(pre > 0) {
                _S.push({val - a[c - 1] + a[c], c, cur + 1, pre - 1});
            }
            if(cur > 0 && c + 1 <= n) {
                _S.push({val - a[c] + a[c + 1], c + 1, 1, cur - 1});
            }
        }
    }
    assert(k == 0);
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    // freopen("A.in", "r", stdin);
    // freopen("A.out", "w", stdout);
    int T = 1;
    // cin >> T;
    while(T--) solve();
}

提出情報

ジャッジ結果