Submission #1518200

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>

using namespace std;

typedef long long int lld;

const lld mod = 1e9+7;
const lld INF = 1e9;
const lld MAXN = 1e5;

int main()
{
	lld n,a[MAXN * 3] = {};

	cin >> n;
	for(int i = 0; i < 3 * n; i++)
	{
		cin >> a[i];
	}

	lld s[MAXN * 3] = {};
	s[0] = a[0];

	for(int i = 1; i < 3*n; i++)
	{
		s[i] = s[i-1] + a[i];
	}

	lld sum = s[3 * n - 1];
	//cout << sum << endl;

	lld z = -INF;
	lld p = n-1;

	for(int i = n-1; i < 2*n; i++)
	{
		lld x = 2 * s[i] - sum;
		if (z < x)
		{
			z = x;
			p = i;
		}
	}

	//cout << "p = " << p << endl;

	vector<lld> b,c;

	for(int i = 0; i < p; i++)
	{
		b.push_back(a[i]);
		//cout << a[i] << " ";
	}

	//printf("\n");
	
	for(int i = p; i < 3 * n; i++)
	{
		c.push_back(a[i]);
		//cout << a[i] << " ";
	}

	//printf("\n");

	sort(b.begin(),b.end(),greater<lld>());
	sort(c.begin(),c.end());

	lld left = 0;

	// for(int i = 0; i < b.size(); i++)
	// {
	// 	cout << b[i] << " ";
	// }
	// printf("\n");

	// for(int i = 0; i < c.size(); i++)
	// {
	// 	cout << c[i] << " ";
	// }
	// printf("\n");


	for(int i = 0; i < n; i++)
	{
		left += b[i];
	}

	lld right = 0;
	for(int i = 0; i < n; i++)
	{
		right += c[i];
	}

	cout << left - right << endl;

	return 0;
}

Submission Info

Judge Result