Submission #4100297

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <map>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <utility>
#include <queue>

#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; i++)
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0; }
template<class T> bool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0; }

typedef long long ll;
using namespace std;

int main() {
    
    int n;
    cin >> n;
    vector<ll> a(n, 0), b(n, 0), c(n, 0);
    ll bsum = 0;

    REP(i, n) {
        cin >> a[i] >> b[i];
        c[i] = a[i] + b[i];
        bsum += b[i];
    }

    sort(ALL_OF(c), greater<ll>());

    ll ans = -bsum;
    for (int i = 0; i < n; i += 2) {
        ans += c[i];
    }
    cout << ans << endl;
    
}

Submission Info

Judge Result