Submission #5942658

---

Source Code Expand

// {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// }}}

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

static constexpr int mod = (int)1e9 + 7;
static constexpr int inf = 100100100;
static constexpr ll linf = 1e18;
static constexpr double eps = 1e-9;
static constexpr double pi = 3.14159265359;

#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (ll i = n; i >= 0; --i)
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define pb push_back
#define ist insert
#define fst first
#define snd second


int main() {
    // cin.tie(0);
    // ios_base::sync_with_stdio(false);
    ll X, Y, Z, K;
    cin >> X >> Y >> Z >> K;
    vector<ll> A, B, C;
    rep (i, X) {
        ll v;
        cin >> v;
        A.pb(v);
    }
    rep (i, Y) {
        ll v;
        cin >> v;
        B.pb(v);
    }
    rep (i, Z) {
        ll v;
        cin >> v;
        C.pb(v);
    }
    vector<ll> AB;
    rep (i, X) {
        rep (j, Y) {
            AB.pb(A[i] + B[j]);
        }
    }
    sort(rall(AB));
    sort(rall(C));
    vector<ll> ABC;
    rep (i, min(K, (ll)AB.size())) {
        rep (j, Z) {
            ABC.pb(AB[i] + C[j]);
        }
    }
    sort(rall(ABC));
    rep (i, K) {
        cout << ABC[i] << endl;
    }
}

Submission Info

Judge Result