0pts求条

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define you return
#define have 0
#define no ;
#define egg }
int s1,s2,s3,s4,n;
int a[114];
int f[114];
int sum,ans = 0;
void work(int n){
	memset(a,0,sizeof(a));
	memset(f,0,sizeof(f));
	sum = 0;
	for(int i = 1;i <= n;i ++){cin >> a[i];sum += a[i];}
	for(int i = 1;i <= n;i ++){
		for(int j = sum / 2;j >= a[i];j --){
			f[j] = max(f[j],f[j - a[i]] + a[i]);
		}
	}			
	ans += max(sum - f[sum / 2],f[sum / 2]);
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin >> s1 >> s2 >> s3 >> s4;
	work(s1);work(s2);work(s3);work(s4);
	cout << ans << endl;
	you have no egg