#include <iostream>
#include <stdio.h>
#include <queue>
using namespace std;
int n;
int main(){
//freopen("PILOT.INP", "r", stdin);
//freopen("PILOT.OUT", "w", stdout);
scanf("%d", &n);
long long sum = 0, res = 0;
priority_queue <int, vector<int> > heap;
for (int i = 1; i <= n; i++){
int u, v;
scanf("%d%d", &u, &v);
sum += u;
heap.push(u-v);
if (i%2 == 1){
res += heap.top();
heap.pop();
}
}
printf("%ld", sum-res);
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHF1ZXVlPgogCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG47CiAKaW50IG1haW4oKXsKICAgIC8vZnJlb3BlbigiUElMT1QuSU5QIiwgInIiLCBzdGRpbik7CiAgICAvL2ZyZW9wZW4oIlBJTE9ULk9VVCIsICJ3Iiwgc3Rkb3V0KTsKICAgIHNjYW5mKCIlZCIsICZuKTsKICAgIGxvbmcgbG9uZyBzdW0gPSAwLCByZXMgPSAwOwogICAgcHJpb3JpdHlfcXVldWUgPGludCwgdmVjdG9yPGludD4gPiBoZWFwOwogICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKXsKICAgICAgICBpbnQgdSwgdjsKICAgICAgICBzY2FuZigiJWQlZCIsICZ1LCAmdik7CiAgICAgICAgc3VtICs9IHU7CiAgICAgICAgaGVhcC5wdXNoKHUtdik7CiAgICAgICAgaWYgKGklMiA9PSAxKXsKICAgICAgICAgICAgcmVzICs9IGhlYXAudG9wKCk7CiAgICAgICAgICAgIGhlYXAucG9wKCk7CiAgICAgICAgfQogICAgfQogICAgcHJpbnRmKCIlbGQiLCBzdW0tcmVzKTsKICAgIHJldHVybiAwOwp9