代码

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int T, n, K, L;
LL ans, a[23333], b[23333], c[23333], d[23333];
int main() {
	cin >> T;
	while (T--) {
		cin >> n >> K >> L, ans = 0;
		for (int i = 0; i < n; i++) cin >> a[i];
		for (int i = 0; i < n; i++) cin >> b[i];
		for (int i = 0; i < (1 << n); i++) {
			int cnt = 0, cnt1 = 0, cnt2 = 0;
			for (int j = 0; j < n; j++)
				if (i & (1 << j)) cnt++;
			if (cnt != L) continue;
			LL tmp = 0;
			for (int j = 0; j < n; j++)
				if (i & (1 << j)) tmp += a[j] + b[j];
				else c[cnt1++] = a[j], d[cnt2++] = b[j];
			sort(c, c + cnt1); reverse(c, c + cnt1);
			sort(d, d + cnt2); reverse(d, d + cnt2);
			for (int j = 0; j < K - L; j++)
				tmp += c[j] + d[j];
			ans = max(ans, tmp);
		}
		cout << ans << endl;
	}
	return 0;
}

评测结果