1467C - Three Bags - CodeForces Solution

#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define nl '\n'
#define int long long
#define ll long long
#define pii pair<ll, ll>
#define mod 998244353  // 998244353  1000000007
using namespace std;
void solve()
{
	int n1, n2, n3;
	cin >> n1 >> n2 >> n3;
	int a[n1], b[n2], c[n3];
	int sum = 0, sum1 = 0, sum2 = 0, sum3 = 0;
	for(int i = 0; i < n1; i++)
	{
		cin >> a[i];
		sum += a[i];
		sum1 += a[i];
	}
	for(int i = 0; i < n2; i++)
	{
		cin >> b[i];
		sum += b[i];
		sum2 += b[i];
	}
	for(int i = 0; i < n3; i++)
	{
		cin >> c[i];
		sum += c[i];
		sum3 += c[i];
	}
	sort(a, a + n1);
	sort(b, b + n2);
	sort(c, c + n3);
	int ans = 0;
	if(n1 == 1)
	{
		ans = max(ans, sum - 2LL*a[0]);
	}
	if(n2 == 1)
	{
		ans = max(ans, sum - 2LL*b[0]);
	}
	if(n3 == 1)
	{
		ans = max(ans, sum - 2LL*c[0]);
	}
	ans = max(ans, sum - 2LL*(a[0] + b[0]));
	ans = max(ans, sum - 2LL*(a[0] + c[0]));
	ans = max(ans, sum - 2LL*(c[0] + b[0]));
	if(n1 > 1 and n1 <= (n2 + n3 - 1))
	{
		ans = max(ans, sum - 2LL*(sum1));
	}
	if(n2 > 1 and n2 <= (n1 + n3 - 1))
	{
		ans = max(ans, sum - 2LL*(sum2));
	}
	if(n3 > 1 and n3 <= (n1 + n2 - 1))
	{
		ans = max(ans, sum - 2LL*(sum3));
	}
	ans = max(ans, sum1 - (sum2 + sum3));
	ans = max(ans, sum2 - (sum1 + sum3));
	ans = max(ans, sum3 - (sum2 + sum1));
	ans = max(ans, sum2 + sum3 - sum1);
	ans = max(ans, sum1 + sum2 - sum3);
	ans = max(ans, sum3 + sum1 - sum2);
	cout << ans << nl;
}
signed main()
{
//	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int t1 = 1;
//	cin >> t1;
	while(t1--)
	{
		solve();
	}
}