Submission #4928185

---

Source Code Expand

#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

//#define _debug
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define sc(x) scanf("%d",&x)
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORd(i,a,b) for(int i=a;i>b;i--)
#define ff first
#define ss second
#define sz(x) x.size()
#define pb push_back
//#define _online_judge

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, //data type
        null_type, //
        less<int>, //
        rb_tree_tag, //red-black tree
        tree_order_statistics_node_update> new_data_set;

typedef pair<int,int> pii;
typedef vector<pii> vii;
const int con = static_cast<const int>(1e6 + 5);
const int MOD = 1000000007;




int main (){
	FASTIO
#ifdef _online_judge
	freopen("input.txt" , "r", stdin);
	//freopen("output.txt", "w", stdout);
#endif

    int x,y,z,l;cin >> x >> y >> z >> l;
    vector<ll> v1(x),v2(y),v3(z);
    FOR(i,0,x){
        cin >> v1[i];
    }sort(v1.begin(),v1.end(),greater<>());

    FOR(i,0,y){
        cin >> v2[i];
    }sort(v2.begin(),v2.end(),greater<>());

    FOR(i,0,z){
        cin >> v3[i];
    }sort(v3.begin(),v3.end(),greater<>());

    vector<ll> ans;
    FOR(i,0,x){

        FOR(j,0,y){

            FOR(k,0,z){

                if((i+1)*(j+1)*(k+1) > l) break;
                ans.pb(v1[i]+v2[j]+v3[k]);
            }
        }
    }
    sort(ans.begin(),ans.end(),greater<>());
    FOR(i,0,l){
        cout << ans[i] << "\n";
    }
    return 0;
}

Submission Info

Judge Result