Problem:
Score : 400 points

Problem Statement

There are N dishes of cuisine placed in front of Takahashi and Aoki.
For convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.

When Takahashi eats Dish i, he earns A_i points of happiness; when Aoki eats Dish i, she earns B_i points of happiness.

Starting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat.
Here, both of them choose dishes so that the following value is maximized: "the sum of the happiness he/she will earn in the end" minus "the sum of the happiness the other person will earn in the end".

Find the value: "the sum of the happiness Takahashi earns in the end" minus "the sum of the happiness Aoki earns in the end".

Constraints

1 \leq N \leq 10^5

1 \leq A_i \leq 10^9

1 \leq B_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 B_1
:
A_N B_N

Output

Print the value: "the sum of the happiness Takahashi earns in the end" minus "the sum of the happiness Aoki earns in the end".

Sample Input 1

3
10 10
20 20
30 30

Sample Output 1

20

In this sample, both of them earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.

In this case, since Takahashi and Aoki have the same "taste", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (30 + 10) - 20 = 20.

Sample Input 2

3
20 10
20 20
20 30

Sample Output 2

20

In this sample, Takahashi earns 20 points of happiness by eating any one of the dishes 1, 2 and 3, but Aoki earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.

In this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (20 + 20) - 20 = 20.

Sample Input 3

6
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000

Sample Output 3

-2999999997

Note that the answer may not fit into a 32-bit integer.

Solution in Rust (1.15.1) (judge verdict: Accepted)

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn argsort<T: std::cmp::Ord + std::marker::Copy>(v: &Vec<T>) -> Vec<usize> {
    let mut sort_v = Vec::new();
    for i in 0..v.len() {
        sort_v.push((v[i], i));
    }
    sort_v.sort();
    sort_v.iter().map(|x| x.1).collect::<Vec<usize>>()
}

fn main() {
    let n = read::<usize>();
    let mut a = vec![0; n];
    let mut b = vec![0; n];
    for i in 0..n {
        let v = read_vec::<i64>();
        a[i] = v[0];
        b[i] = v[1];
    }
    let mut base_a = Vec::new();
    let mut base_b = Vec::new();
    for i in 0..n {
        base_a.push(a[i] + b[i]);
        base_b.push(b[i] + a[i]);
    }

    let mut a_index = argsort(&base_a);
    let mut b_index = argsort(&base_b);
    let mut used_candidate = std::collections::HashSet::new();

    let mut ans = 0i64;
    for i in 0..n / 2 {
        let mut a_candidate;
        loop {
            a_candidate = a_index[a_index.len() - 1];
            if !used_candidate.contains(&a_candidate) {
                break;
            } else {
                a_index.pop();
            }
        }
        let mut b_candidate;
        loop {
            b_candidate = b_index[b_index.len() - 1];
            if !used_candidate.contains(&b_candidate) {
                break;
            } else if a_candidate == b_candidate {
                continue;
            } else {
                b_index.pop();
            }
        }
        let plan_1_diff = a[a_candidate] - b[b_candidate];
        let plan_2_diff = a[b_candidate] - b[a_candidate];
        if plan_1_diff > plan_2_diff {
            ans += a[a_candidate];
            used_candidate.insert(a_candidate);
        } else {
            ans += a[b_candidate];
            used_candidate.insert(b_candidate);
        }

        let mut b_candidate;
        loop {
            b_candidate = b_index[b_index.len() - 1];
            if !used_candidate.contains(&b_candidate) {
                break;
            } else {
                b_index.pop();
            }
        }
        let mut a_candidate;
        loop {
            a_candidate = a_index[a_index.len() - 1];
            if !used_candidate.contains(&a_candidate) {
                break;
            } else if a_candidate == b_candidate {
                continue;
            } else {
                a_index.pop();
            }
        }
        let plan_1_diff = b[a_candidate] - a[b_candidate];
        let plan_2_diff = b[b_candidate] - a[a_candidate];
        if plan_1_diff > plan_2_diff {
            ans -= b[a_candidate];
            used_candidate.insert(a_candidate);
        } else {
            ans -= b[b_candidate];
            used_candidate.insert(b_candidate);
        }
    }
    if n % 2 == 1 {
        let mut a_candidate;
        loop {
            a_candidate = a_index.pop().unwrap();
            if !used_candidate.contains(&a_candidate) {
                used_candidate.insert(a_candidate);
                break;
            }
        }
        ans += a[a_candidate];
    }
    println!("{}", ans);
}