Submission #1678295
Source Code Expand
#include <iostream> #include <queue> #include <algorithm> #include <vector> #define ll long long using namespace std; int main(void){ int n, a[300005]; long long sum_front=0, sum_back=0; vector<ll> sf, sb; priority_queue<ll, vector<ll>, greater<ll> > que_front; priority_queue<ll> que_back; cin >> n; for( int i = 0; i< 3 * n; i++ ){ cin >> a[i]; if(i < n){ sum_front += a[i]; que_front.push(a[i]); }else if( 2*n <= i ){ sum_back += a[i]; que_back.push(a[i]); } } sf.push_back(sum_front); sb.push_back(sum_back); for( int i = 0; i < n ; i++ ){ que_front.push(a[i+n]); sum_front += a[i+n]; sum_front -= que_front.top(); que_front.pop(); sf.push_back(sum_front); que_back.push(a[2*n-1-i]); sum_back += a[2*n-1-i]; sum_back -= que_back.top(); que_back.pop(); sb.push_back(sum_back); } reverse(sb.begin(), sb.end()); long long ans = sf[0] - sb[0]; for( int i = 1; i <= n; i++ ){ ans = max(ans, sf[i] - sb[i]); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 3N Numbers |
User | Ronly |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1250 Byte |
Status | AC |
Exec Time | 148 ms |
Memory | 5492 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | 200 / 200 | ||||||
Status |
|
|
|
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 | 3 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 | 3 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 | 3 ms | 256 KB |
1_21.txt | AC | 3 ms | 256 KB |
1_22.txt | AC | 3 ms | 256 KB |
1_23.txt | AC | 3 ms | 256 KB |
2_00.txt | AC | 61 ms | 5364 KB |
2_01.txt | AC | 144 ms | 5364 KB |
2_02.txt | AC | 114 ms | 5364 KB |
2_03.txt | AC | 115 ms | 5364 KB |
2_04.txt | AC | 115 ms | 5364 KB |
2_05.txt | AC | 114 ms | 5364 KB |
2_06.txt | AC | 131 ms | 5364 KB |
2_07.txt | AC | 116 ms | 5364 KB |
2_08.txt | AC | 64 ms | 5364 KB |
2_09.txt | AC | 63 ms | 5364 KB |
2_10.txt | AC | 64 ms | 5492 KB |
2_11.txt | AC | 63 ms | 5364 KB |
2_12.txt | AC | 147 ms | 5364 KB |
2_13.txt | AC | 148 ms | 5364 KB |
2_14.txt | AC | 148 ms | 5364 KB |
2_15.txt | AC | 148 ms | 5364 KB |