For this Question: Pino is super fond of candies. Today she has A chocolate candies, B orange candies, and C unknown candies. You are also given the happiness she gets after eating a particular candy. 
She wants to have exactly X chocolate candies and Y orange candies. She can transform an unknown candy into a candy of any type (chocolate or orange).
Find the maximum happiness she can attain.The first line of input contains 5 integers X, Y, A, B, and C.
The second line contains an A integer corresponding to the happiness of the various chocolate candies.
The third line contains B integers corresponding to the happiness of the various orange candies.
The fourth line contains C integers corresponding to the happiness of the various unknown candies.

<b>Constraints:-</b>
1 <= A, B, C <= 100000
1 <= X <= A
1 <= Y <= B
1 <= happiness of any candy <= 1000000000 (10^9)Output a single integer, the maximum happiness Pino can achieve by eating the candies.Sample Input 1:-
1 2 2 2 1
2 4
5 1
3

Sample Output 1:-
12

Sample Input 2:-
2 2 2 2 2
8 6
9 1
2 1

Sample Output 2:-
25

<b>Explanation:-</b>
Pino eats the 2nd chocolate candy (happiness=4), then eats the 1st orange candy (happiness=4+5=9), then transforms the first unknown candy to orange candy and eats it (happiness=9+3=12), I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(ll i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define int long long
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define MOD 1000000007
#define INF 1000000000000000007LL

const int N = 100005;
 
// it's swapnil07 ;)
 
#ifdef SWAPNIL07
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif

int red[N], grn[N], col[N];

signed main()
{
    fast
    #ifdef SWAPNIL07
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif
    int x, y, a, b, c; cin>>x>>y>>a>>b>>c;
    For(i, 0, a){
        cin>>red[i];
    }
    For(i, 0, b){
        cin>>grn[i];
    }
    For(i, 0, c){
        cin>>col[i];
    }
    vector<int> vect;
    sort(red, red+a); sort(grn, grn+b);
    reverse(red, red+a); reverse(grn, grn+b);
    For(i, 0, x){
        vect.pb(red[i]);
    }
    For(i, 0, y){
        vect.pb(grn[i]);
    }
    For(i, 0, c){
        vect.pb(col[i]);
    }
    sort(all(vect));
    reverse(all(vect));
    int ans = 0;
    For(i, 0, x+y){
        ans+=vect[i];
    }
    cout<<ans;
    return 0;

}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?