#include <bits/stdc++.h>
using namespace std;
int main() {
priority_queue<int> pQ;
int ans = 0;
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int c, a;
scanf("%d %d", &c, &a);
ans += c;
pQ.push(c - a);
if (i%2 == 0) {
ans += -pQ.top();
pQ.pop();
}
}
printf ("%d\n", ans);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCXByaW9yaXR5X3F1ZXVlPGludD4gcFE7CglpbnQgYW5zID0gMDsKCWludCBuOwoJc2NhbmYoIiVkIiwgJm4pOwoJZm9yIChpbnQgaSA9IDA7IGkgPCBuOyArK2kpIHsKCQlpbnQgYywgYTsKCQlzY2FuZigiJWQgJWQiLCAmYywgJmEpOwoJCWFucyArPSBjOwoJCXBRLnB1c2goYyAtIGEpOwoJCWlmIChpJTIgPT0gMCkgewoJCQlhbnMgKz0gLXBRLnRvcCgpOwoJCQlwUS5wb3AoKTsKCQl9Cgl9CglwcmludGYgKCIlZFxuIiwgYW5zKTsKCXJldHVybiAwOwkKfQ==