Language: C++

#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;

long long  fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % MOD;
		inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
		finv[i] = finv[i - 1] * inv[i] % MOD;
	}
}

// 二項係数計算
long long COM(int n, int k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y){
	return(x + y - 1) / y;

}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
	long long int m = number1;
	long long int n = number2;

	if (number2 > number1) {
		m = number2;
		n = number1;
	}
	long long int s = -1;
	while (s != 0) {
		s = m % n;
		m = n;
		n = s;
	}
	return m;
}
/*最大公倍数*/
long long int gcd(long long int number1, long long int number2) {
	long long int m = number1;
	long long int n = number2;
	return m / lcm(m, n) * n;
}
/*逆元計算*/
long long int  modinv(long long a, long long m) {
	long long int b = m, u = 1, v = 0;
	while (b) {
		long long int t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	u %= m;
	if (u < 0) u += m;
	return u;
}
// index が条件を満たすかどうか
vector<long long int >meguru;
bool isOK(int index, int key) {
	if (meguru[index] >= key) return true;
	else return false;
}
// 汎用的な二分探索のテンプレ
int binary_search(int key) {
	int left = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
	int right = (int)meguru.size(); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は a.size()
	/* どんな二分探索でもここの書き方を変えずにできる！ */
	while (right - left > 1) {
		int mid = left + (right - left) / 2;

		if (isOK(mid, key)) right = mid;
		else left = mid;
	}
	/* left は条件を満たさない最大の値、right は条件を満たす最小の値になっている */
	return right;
}
long long modpow(long long a, long long n, long long mod) {
	long long res = 1;
	while (n > 0) {
		if (n & 1) res = res * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return res;
}
int main() {
	long long int x, y, a, b, c;
	cin >> x >> y >> a >> b >> c;
	vector<long long int>as;
	vector<long long int>bs;
	vector<long long int>cs;
	for (int i = 0; i < a; i++) {
		long long int in;
		cin >> in;
		as.push_back(in);
	}
	for (int i = 0; i < b; i++) {
		long long int in;
		cin >> in;
		bs.push_back(in);
	}
	for (int i = 0; i < c; i++) {
		long long int in;
		cin >> in;
		cs.push_back(in);
	}
	sort(as.begin(), as.end(), greater<long long int>());
	sort(bs.begin(), bs.end(), greater<long long int>());
	sort(cs.begin(), cs.end(), greater<long long int>());
	vector<long long int >get;
	long long int ans = 0;
	for (int i = 0; i < x; i++) {
		get.push_back(as[i]);
		ans = ans + as[i];
	}
	for (int i = 0; i < y; i++) {
		get.push_back(bs[i]);
		ans = ans + bs[i];
	}
	sort(get.begin(), get.end());
	for (int i = 0; i < min(long long int(cs.size()), x + y); i++) {
		if (cs[i] > get[i]) {
			ans = ans + cs[i]-get[i];
		}
	}
	cout << ans;
 }


Compiler output:
a.cc: In function 'int main()':
a.cc:130:33: error: expected primary-expression before 'long'
  130 |         for (int i = 0; i < min(long long int(cs.size()), x + y); i++) {
      |                                 ^~~~