Submission #1298109


Source Code Expand

#include <stdio.h>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 100005;
int n, A[3*MAXN];
ll L[3*MAXN], R[3*MAXN];
int main() {
	scanf("%d", &n);
	priority_queue <int> pq;
	for (int i = 1; i <= 3 * n; i++) scanf("%d", &A[i]);
	for (int i = 1; i <= n; i++) L[n] += A[i], pq.push(-A[i]);
	for (int i = n + 1; i <= 2 * n; i++) {
		int x = -pq.top();
		if (A[i] - x > 0) {
			L[i] = L[i - 1] + A[i] - x;
			pq.pop();
			pq.push(-A[i]);
		}
		else L[i] = L[i - 1];
	}
	priority_queue <int> pq2;
	for (int i = 3 * n; i >= 2 * n + 1; i--) R[2 * n + 1] += A[i], pq2.push(A[i]);
	for (int i = 2 * n; i >= n + 1; i--) {
		int x = pq2.top();
		if (A[i] - x < 0) {
			R[i] = R[i + 1] + A[i] - x;
			pq2.pop();
			pq2.push(A[i]);
		}
		else R[i] = R[i + 1];
	}
	ll ans = -1e18;
	for (int i = n; i <= 2 * n; i++) {
		ans = max(ans, L[i] - R[i + 1]);
	}
	printf("%lld", ans);
}

Submission Info

Submission Time
Task D - 3N Numbers
User hongjun7
Language C++14 (GCC 5.4.1)
Score 500
Code Size 953 Byte
Status AC
Exec Time 57 ms
Memory 5112 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:12:53: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= 3 * n; i++) scanf("%d", &A[i]);
                                                     ^

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 2304 KB
0_01.txt AC 1 ms 2304 KB
0_02.txt AC 1 ms 2304 KB
1_00.txt AC 1 ms 2304 KB
1_01.txt AC 1 ms 2304 KB
1_02.txt AC 1 ms 2304 KB
1_03.txt AC 1 ms 2304 KB
1_04.txt AC 1 ms 2304 KB
1_05.txt AC 1 ms 2304 KB
1_06.txt AC 1 ms 2304 KB
1_07.txt AC 1 ms 2304 KB
1_08.txt AC 2 ms 2304 KB
1_09.txt AC 2 ms 2304 KB
1_10.txt AC 2 ms 2304 KB
1_11.txt AC 2 ms 2304 KB
1_12.txt AC 2 ms 2304 KB
1_13.txt AC 2 ms 2304 KB
1_14.txt AC 2 ms 2304 KB
1_15.txt AC 2 ms 2304 KB
1_16.txt AC 2 ms 2304 KB
1_17.txt AC 2 ms 2304 KB
1_18.txt AC 2 ms 2304 KB
1_19.txt AC 2 ms 2304 KB
1_20.txt AC 2 ms 2304 KB
1_21.txt AC 2 ms 2304 KB
1_22.txt AC 2 ms 2304 KB
1_23.txt AC 2 ms 2304 KB
2_00.txt AC 26 ms 5112 KB
2_01.txt AC 40 ms 5112 KB
2_02.txt AC 45 ms 5112 KB
2_03.txt AC 40 ms 5112 KB
2_04.txt AC 40 ms 5112 KB
2_05.txt AC 40 ms 5112 KB
2_06.txt AC 40 ms 5112 KB
2_07.txt AC 35 ms 5112 KB
2_08.txt AC 33 ms 5112 KB
2_09.txt AC 33 ms 5112 KB
2_10.txt AC 33 ms 5112 KB
2_11.txt AC 32 ms 5112 KB
2_12.txt AC 56 ms 5112 KB
2_13.txt AC 57 ms 5112 KB
2_14.txt AC 57 ms 5112 KB
2_15.txt AC 56 ms 5112 KB