Submission #5905002


Source Code Expand

#include <bits/stdc++.h>

#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define MIN(c) (*min_element(ALL(c))) 
#define MAX(c) (*max_element(ALL(c)))
#define ACC(c) (accumulate(ALL(c), 0))
#define MP(a, b) (make_pair((a), (b)))
#define ENDL "\n"
#define PRINT(x) cout << (x) << ENDL

using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;

inline int in(int& a) {return scanf("%d", &a);}
inline void out(int n) {printf("%d\n", n);}
template<typename T> inline void swap(T& a, T& b) {T tmp = a; a = b; b = tmp;}
auto pint_compare = [](pint x, pint y) -> bool{return (x.first < y.first);};


int N;
int a[300000];
priority_queue<int, vector<int>, greater<int> > L;
priority_queue<int, vector<int>, greater<int> > R;

signed main(){
    in(N);
    REP(i, 3 * N) in(a[i]);
    ll sum = 0;
    REP(i, N){
        L.push(a[i]);
        R.push(- a[3 * N - 1 - i]);
        sum += a[i] - a[3 * N - 1 - i];
    }
    int head = N, tale = 2 * N - 1;
    while(head <= tale){
        int l = a[head] - L.top();
        int r = - a[tale] - R.top();
        if(l <= 0 && r <= 0){
            if(l > r) tale--;
            else head++;
        }else if(l > r){
            L.pop();
            L.push(a[head]);
            sum += l;
            head++;
        }else{
            R.pop();
            R.push(a[tale]);
            sum += r;
            tale--;
        }
    }
    PRINT(sum);
    return 0;
}

Submission Info

Submission Time
Task D - 3N Numbers
User N45h
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1596 Byte
Status WA
Exec Time 48 ms
Memory 2428 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 200
Status
AC × 3
AC × 19
WA × 8
AC × 27
WA × 16
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 1 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 1 ms 256 KB
1_16.txt WA 1 ms 256 KB
1_17.txt WA 1 ms 256 KB
1_18.txt WA 1 ms 256 KB
1_19.txt WA 1 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 25 ms 2428 KB
2_01.txt AC 38 ms 2428 KB
2_02.txt AC 38 ms 2428 KB
2_03.txt AC 38 ms 2428 KB
2_04.txt AC 38 ms 2428 KB
2_05.txt AC 38 ms 2428 KB
2_06.txt AC 38 ms 2428 KB
2_07.txt AC 33 ms 2428 KB
2_08.txt WA 28 ms 2428 KB
2_09.txt WA 28 ms 2428 KB
2_10.txt WA 28 ms 2428 KB
2_11.txt WA 28 ms 2428 KB
2_12.txt WA 47 ms 2428 KB
2_13.txt WA 47 ms 2428 KB
2_14.txt WA 48 ms 2428 KB
2_15.txt WA 47 ms 2428 KB