#include <iosteam>
#include <queue>
#include <set>

using namespace std;

class cyy {
public:
    int a;
    int b;

public:
    cyy(int i_a, int i_b) : a(i_a), b(i_b) {}
    bool operator<(const cyy &i_cyy) const { return (a + b) < (i_cyy.a + i_cyy.b); }
};

class csf {
public:
    int a;
    int b;

public:
    csf(int i_a, int i_b) : a(i_a), b(i_b) {}
    bool operator<(const csf &i_cyy) const {
        if (a < i_cyy.a)
            return true;
        else if (a > i_cyy.a)
            return false;
        else
            return b < i_cyy.b;
    }
};

class card {
public:
    int a;
    int b;
    card(int i_a, int i_b) : a(i_a), b(i_b) {}
    bool operator<(const card &i_cyy) const {
        if (a < i_cyy.a)
            return true;
        else if (a > i_cyy.a)
            return false;
        else
            return b < i_cyy.b;
    }
};

/*pq.push(2); cout<<pq.top()<<endl; pq.pop();*/

int main() {
    int num;
    int get_scores = 0;
    int a, b;
    set<card> search_tree;
    search_tree.clear();
    priority_queue<cyy, vector<cyy>> queue_cyy;
    priority_queue<csf, vector<csf>> queue_csf;
    cin >> num;
    for (int i = 0; i < num; i++) {
        cin >> a >> b;
        queue_cyy.push(cyy(a, b));
        queue_csf.push(csf(a, b));
    }
    for (int i = 0; i < num; i++) {
        if (i % 2 == 0) {
            csf tmp = queue_csf.top();
            queue_csf.pop();
            while (search_tree.find(card(tmp.a, tmp.b)) != search_tree.end()) {
                tmp = queue_csf.top();
                queue_csf.pop();
            }
        } else {
            cyy tmp = queue_cyy.top();
            queue_csf.pop();
            while (search_tree.find(card(tmp.a, tmp.b)) != search_tree.end()) {
                tmp = queue_cyy.top();
                queue_csf.pop();
            }
            get_scores += tmp.b;
        }
    }
    cout << get_scores;
    // cin.get();
    return 0;
}

/sandbox/1/a.cpp:1:10: fatal error: iosteam: No such file or directory
 #include <iosteam>
          ^~~~~~~~~
compilation terminated.