Submission #4101440

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int max(int a, int b) { return (a > b) ? a : b; }

const int MAXN = 100000;

int a[MAXN];
int b[MAXN];


const int INF = 1e9;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;
    vector<pair<int, int>> v;
    v.reserve(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i] >> b[i];
        v.emplace_back(a[i] + b[i], i);
    }
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    int i = 1;
    ll ans = 0;
    for (auto& p : v)
    {
        if (i == 1)
        {
            ans += a[p.second];
            i = 0;
        } else
        {
            i = 1;
            ans -= b[p.second];
        }
    }

    cout << ans;
    return 0;
}

Submission Info

Judge Result