Submission #5908232

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <queue>
#include <set>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int, int> PII;
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define PB push_back
#define MP make_pair
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define IFOR(v,it) for(VI::iterator it=(v).begin();it!=(v).end();++it)


int main() {
  int N;
  cin >> N;

  priority_queue<int, VI, greater<int> > head;
  deque<int> body;
  priority_queue<int> tail;
  int 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();
    int diff1 = front - head.top(), diff2 = tail.top() - back;
    if (diff1 > diff2) {
      if (diff1 >= 0) {
        body.pop_front();
        head_sum = head_sum - head.top() + front;
        head.pop();
      }
    } else {
      if (diff2 >= 0) {
        body.pop_back();
        tail_sum = tail_sum - tail.top() + back;
        tail.pop();
      }
    }
  }
  cout << head_sum - tail_sum << endl;
  return 0;
}

Submission Info

Judge Result