代码：

#include<bits/stdc++.h>
using namespace std;
#define qwq ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
int s[5], w[22], sd = 0, ans = 0;
bool f[22];

int SPA(int n)
{
	int q, p;
	q = p = 0;
	for (int i = 1; i <= n; i++)
	{
		if (f[i] == 1)
			q += w[i];
		else
			p += w[i];
	}
	if (sd > max(q, p))
		sd = max(q, p);
}

void dfs(int i, int n)
{
	if (i > n)
	{
		SPA(n);	
		return;
	}
	f[i] = 1;
	dfs(i + 1, n);
	f[i] = 0;
	dfs(i + 1, n);
}

int main()
{
	qwq;
	for (int i = 1; i <= 4; i++)
	{
		cin >> s[i];
	}
	for (int i = 1; i <= 4; i++)
	{
		sd = 1145141919;
		for (int j = 1; j <= s[i]; j++)
		{
			cin >> w[j];
		}
		dfs (1, s[i]);
		ans += sd;
	}
	cout << ans;
	return 0;
}