Submission #5908251
Source Code Expand
#include <iostream> #include <algorithm> #include <utility> #include <vector> #include <queue> using namespace std; typedef vector<int> VI; typedef long long LL; #define PB push_back #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) int main() { int N; cin >> N; priority_queue<int, VI, greater<int> > head; deque<int> body; priority_queue<int> tail; LL head_sum = 0, tail_sum = 0; REP(i, N) { int a; cin >> a; head.push(a); head_sum += a; } REP(i, N) { int a; cin >> a; body.PB(a); } REP(i, N) { int a; cin >> a; tail.push(a); tail_sum += a; } while (!body.empty() && (body.front() >= head.top() || body.back() <= tail.top())) { int front = body.front(), back = body.back(); LL diff1 = front - head.top(), diff2 = tail.top() - back; if (diff1 >= diff2) { body.pop_front(); head_sum = head_sum - head.top() + front; head.pop(); } else { body.pop_back(); tail_sum = tail_sum - tail.top() + back; tail.pop(); } } cout << head_sum - tail_sum << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 3N Numbers |
User | pandanoir |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1162 Byte |
Status | WA |
Exec Time | 134 ms |
Memory | 1784 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | 0 / 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 | 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 | WA | 2 ms | 256 KB |
1_17.txt | WA | 2 ms | 256 KB |
1_18.txt | WA | 2 ms | 256 KB |
1_19.txt | WA | 2 ms | 256 KB |
1_20.txt | WA | 2 ms | 256 KB |
1_21.txt | WA | 2 ms | 256 KB |
1_22.txt | WA | 2 ms | 256 KB |
1_23.txt | WA | 2 ms | 256 KB |
2_00.txt | AC | 51 ms | 1784 KB |
2_01.txt | AC | 134 ms | 1784 KB |
2_02.txt | AC | 102 ms | 1784 KB |
2_03.txt | AC | 103 ms | 1784 KB |
2_04.txt | AC | 102 ms | 1784 KB |
2_05.txt | AC | 102 ms | 1784 KB |
2_06.txt | AC | 102 ms | 1784 KB |
2_07.txt | AC | 99 ms | 1784 KB |
2_08.txt | WA | 54 ms | 1784 KB |
2_09.txt | WA | 54 ms | 1784 KB |
2_10.txt | WA | 54 ms | 1784 KB |
2_11.txt | WA | 54 ms | 1784 KB |
2_12.txt | WA | 121 ms | 1784 KB |
2_13.txt | WA | 122 ms | 1784 KB |
2_14.txt | WA | 122 ms | 1784 KB |
2_15.txt | WA | 122 ms | 1784 KB |