Language: C++

//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define mp make_pair
#define fo(i, n1, n, x) for(int i = n1; i <= n; i += x)
#define foo(i, n, n1, x) for(int i = n; i >= n1; i -= x)
#define bit __builtin_popcount
#define md (l + ((r - l) / 2))
#define all(x) x.begin(),x.end()
#define eb emplace_back
#define ub upper_bound
#define lb lower_bound
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)

using namespace std;
//using namespace __gnu_pbds;
//using namespace __gnu_cxx;


using ll = long long;

//#define int ll

using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;



const int N = 2e5 + 11, mod = 1e9 + 7, mod2 = 998244353;
const int MAX = 1e5 + 11;
const int INF1 = 2e9 + 11;
const ll INF2 = 2e18 + 11;
const double INF3 = 1e8 + 11;
const int base = 500;
const int P = 31;
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
const double EPS = 1e-4;
const double PI = acos(-1.0);


//template<typename T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int x, y, n, m, k, a[N], b[N], c[N], ans, us[2][N];
main() {
  file("threesum");
  ios;
  cin >> x >> y >> n >> m >> k;
  vector < pair <int, pii> > v;
  fo(i, 1, n, 1) cin >> a[i], v.eb(mp(a[i], mp(i, 1)));
  fo(i, 1, m, 1) cin >> b[i], v.eb(mp(b[i], mp(i, 2)));
  fo(i, 1, k, 1) cin >> c[i], v.eb(mp(c[i], mp(i, 3)));
  sort(all(v));
  reverse(all(v));
  int sz = v.size();
  int X = x, Y = y;
  queue <int> q;
  for (int i = 0; i < min(sz, x + y); ++i) {
    if (v[i].S.S == 1) {
      if (X) {
        --X;
//        ++cnt;
        ans += v[i].F;
        us[0][v[i].S.F] = 1;
      }
    } else {
      if (v[i].S.S == 2) {
        if (Y) {
          --Y;
   //       ++cnt;
          ans += v[i].F;
          us[1][v[i].S.F] = 1;
        }
      } else {
        q.push(v[i].S.F);
      }
    }
  }
  for (int i = x + y; i < sz; ++i) if (v[i].S.S == 3) q.push(v[i].S.F);
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    if (!X and !Y) break;
    if (X) {
      --X;
      ans += c[v];
    } else {
      ans += c[v];
      --Y;
    }
  }
  if (X) {
    fo(i, 1, n, 1) if (!us[0][i] and X) --X, ans += a[i];
  }
  if (Y) {
    fo(i, 1, M, 1) if (!us[1][i] and Y) --Y, ans += b[i];
  }
  cout << ans;
  return 0;
}
/**

*/


Compiler output:
a.cc:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main() {
      | ^~~~
a.cc: In function 'int main()':
a.cc:112:14: error: 'M' was not declared in this scope
  112 |     fo(i, 1, M, 1) if (!us[1][i] and Y) --Y, ans += b[i];
      |              ^
a.cc:14:46: note: in definition of macro 'fo'
   14 | #define fo(i, n1, n, x) for(int i = n1; i <= n; i += x)
      |                                              ^