Submission #1518161


Source Code Expand

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

#define pb         push_back

typedef long long ll;
const ll INF = 1000000000000000000ll;
const ll MOD = 1000000007ll;
const double EPS = 1e-8;

ll asum[100005];
ll csum[100005];
int main(void) {
	//ios_base::sync_with_stdio(false);
	//cin.tie(0);
	
	int n;
	cin >> n;

	priority_queue<int, vector<int>, greater<int> > a;
	vector<int> b;
	priority_queue<int> c;

	for(int i=0; i<n; i++){
		int t;
		cin >> t;
		a.push(t);
		asum[0] += t;
	}
	b.pb(0);
	for(int i=0; i<n; i++){
		int t;
		cin >> t;
		b.pb(t);
	}

	for(int i=0; i<n; i++){
		int t;
		cin >> t;
		c.push(t);
		csum[n+1] += t;
	}

	for(int i=1; i<=n; i++){
		asum[i] = asum[i-1];
		if(b[i] > a.top()){
			asum[i] -= a.top();
			a.pop();
			a.push(b[i]);
			asum[i] += b[i];
		}
	}
	for(int i=n; i>=1; i--){
		csum[i] = csum[i+1];
		if(b[i] < c.top()){
			csum[i] -= c.top();
			c.pop();
			c.push(b[i]);
			csum[i] += b[i];
		}
	}

	ll ma = -INF;
	for(int i=0; i<=n; i++){
		ma = max(ma, asum[i] - csum[i+1]);
	}


	cout << ma << endl;
	
	return 0;
}

Submission Info

Submission Time
Task D - 3N Numbers
User tanutarou
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1132 Byte
Status AC
Exec Time 139 ms
Memory 3064 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 200 / 200
Status
AC × 3
AC × 27
AC × 43
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
Subtask 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 2 ms 256 KB
1_09.txt AC 2 ms 256 KB
1_10.txt AC 2 ms 256 KB
1_11.txt AC 2 ms 256 KB
1_12.txt AC 2 ms 256 KB
1_13.txt AC 2 ms 256 KB
1_14.txt AC 2 ms 256 KB
1_15.txt AC 2 ms 256 KB
1_16.txt AC 2 ms 256 KB
1_17.txt AC 2 ms 256 KB
1_18.txt AC 2 ms 256 KB
1_19.txt AC 2 ms 256 KB
1_20.txt AC 2 ms 256 KB
1_21.txt AC 2 ms 256 KB
1_22.txt AC 2 ms 256 KB
1_23.txt AC 2 ms 256 KB
2_00.txt AC 49 ms 3064 KB
2_01.txt AC 129 ms 3064 KB
2_02.txt AC 110 ms 3064 KB
2_03.txt AC 105 ms 3064 KB
2_04.txt AC 105 ms 3064 KB
2_05.txt AC 105 ms 3064 KB
2_06.txt AC 104 ms 3064 KB
2_07.txt AC 99 ms 3064 KB
2_08.txt AC 56 ms 3064 KB
2_09.txt AC 55 ms 3064 KB
2_10.txt AC 55 ms 3064 KB
2_11.txt AC 55 ms 3064 KB
2_12.txt AC 139 ms 3064 KB
2_13.txt AC 139 ms 3064 KB
2_14.txt AC 139 ms 3064 KB
2_15.txt AC 138 ms 3064 KB