Greedy Game

#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define LINF 999999999999999999LL
#define N (1<<17)
#define M 1000000007

using namespace std;

int main () {
  int n;
  cin>>n;
  vector<pair<ll, ll>> v(n);
  for (int i = 0; i < n; i++) {
    cin>>v[i].first;
  }
  for (int i = 0; i < n; i++) {
    cin>>v[i].second;
  }
  sort(v.rbegin(), v.rend());
  ll ans = 0;
  
  priority_queue<ll> q;
  
  for (int i = 1; i < n; i++) {
    if (i % 2) q.push(-v[i].second);
    else if (v[i].second > -q.top()) {
      q.pop();
      q.push(-v[i].second);
    }
  }
  
  while (!q.empty()) {
    ans -= q.top();
    q.pop();
  }
  
  cout<<ans<<endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED