Submission #1518785

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define all(c) begin(c),end(c)
const ll INF = 1e11;

int main() {
	cin.sync_with_stdio(false);
	int N;
	cin >> N;
	vector<int>a(3 * N);
	rep(i, 3 * N)cin >> a[i];
	ll ans = -INF;
	reps(i, N, 2 * N + 1) {
		priority_queue<int,vector<int>,greater<int>>minq;
		priority_queue<int>maxq;
		ll sum1 = 0, sum2 = 0;
		rep(j, i) {
			minq.push(a[j]);
			sum1 += a[j];
		}
		rep(j,i-N) {
			sum1 -= minq.top();
			minq.pop();
		}
		reps(j, i, 3 * N) {
			maxq.push(a[j]);
			sum2 += a[j];
		}
		rep(j, 2 * N - i) {
			sum2 -= maxq.top();
			maxq.pop();
		}
		ans = max(sum1 - sum2,ans);
	}
	cout << ans << "\n";
	return 0;
}

Submission Info

Judge Result