Submission #4643641

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3") 
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x) 
#endif
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  2019/03/21  Problem: ABC 062 D / Link: http://abc062.contest.atcoder.jp/tasks/abc062_d  ----- */


int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	LL N;
	cin >> N;
	vector<LL> a(3 * N);
	for (int i = 0; i < 3 * N; ++i) {
		cin >> a[i];
	}
	VL frontmaxsum(3 * N, 0); { // [0..i]
		multiset<LL>front;
		LL sum = 0;
		FOR(i, 0, 2 * N) {
			sum += a[i];
			front.insert(a[i]);
			if (SZ(front) > N) {
				auto it = front.begin();
				sum -= *it;
				front.erase(it);
			}

			frontmaxsum[i] = sum;
		}
	}

	VL backminsum(3 * N, 0); {//[i..3N*-1]
		multiset<LL>back;
		LL sum = 0;
		FORR(i, 3 * N - 1, N - 1) {
			sum += a[i];
			back.insert(a[i]);
			if (SZ(back) > N) {
				auto it = prev(back.end());
				sum -= *it;
				back.erase(it);
			}

			backminsum[i] = sum;
		}

	}

	LL ans =-LINF;
	FOR(i, N - 1, 2 * N) {
		ans = max(ans, frontmaxsum[i] - backminsum[i + 1]);
	}

	cout << (ans) << "\n";

	return 0;
}

Submission Info

Judge Result