Submission #1987441

---

Source Code Expand

#include <iostream>
using namespace std;
const int mod = 1000000007;
int N, M, K, s, a[59], b[59]; long long dp[2500009];
int main() {
	cin >> N >> M >> K;
	for (int i = 0; i < N; i++) cin >> a[i], s += a[i];
	for (int i = 0; i < M; i++) cin >> b[i], s += b[i];
	dp[0] = 1;
	for (int i = 0; i < N; i++) {
		for (int j = 2499999; j >= a[i]; j--) {
			dp[j] |= dp[j - a[i]];
		}
	}
	for (int i = 0; i < M; i++) {
		for (int j = 2499999; j >= b[i]; j--) {
			dp[j] |= dp[j - b[i]] << 1;
		}
	}
	int best = -1, evl = 102345678;
	for (int i = 0; i <= s; i++) {
		int ev = i * 2 < s ? s - i * 2 : i * 2 - s;
		for (int j = K % 2; j <= M && j <= K; j += 2) {
			if (((dp[i] >> j) & 1) && ev < evl) {
				evl = ev;
				best = i;
			}
		}
	}
	cout << 1LL * best * (s - best) << endl;
	return 0;
}

Submission Info

Judge Result