提出 #72481003

---

ソースコード 拡げる

#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, 3>> _S;
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, m, 2});
    while(k > 0) {
        auto [val, m, c] = _S.top(); _S.pop();
        cout << val << endl;
        k--;

        if(m > 0) {
            for(int i = c; i <= n; i++)
                _S.push({val - a[1] + a[i], m - 1, i});
        }
    }
    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();
}

提出情報

ジャッジ結果