#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main()
{

    int n;
    cin >> n;

    vector<int> a(n), b(n);
    for(int i = 0; i < n; i++) cin >> a[i] >> b[i];

    multiset<pair<int, int>> f, s, t;

    for(int i = 0; i < n; i++){
        f.insert({b[i], i});
        s.insert({b[i]+a[i], i});
    }

    ll ans = 0;

    int maxB = 0;
    for(int i = 1; i <= n; i++){
        ll can1 = 1e18, can2 = 1e18, idx1, idx2;
        if(!s.empty()){
            auto [x, y] = *s.begin();
            can1 = x;
            idx1 = y;
        }
        if(!t.empty()){
            auto [x, y] = *t.begin();
            can2 = x;
            idx2 = y;
        }
        if(can1 < can2){
            ans -= maxB;
            ans += can1;
            maxB = max(maxB, b[idx1]);
            f.erase({b[idx1], idx1});
            s.erase({b[idx1] + a[idx1], idx1});
            t.erase({a[idx1], idx1});
        } else {
            ans += can2;
            maxB = max(maxB, b[idx2]);
            f.erase({b[idx2], idx2});
            s.erase({b[idx2] + a[idx2], idx2});
            t.erase({a[idx2], idx2});
        }
        while(!f.empty() && (*f.begin()).first <= maxB){
            auto [x, y] = *f.begin();
            f.erase(f.begin());
            s.erase({a[y]+b[y], y});
            t.insert({a[y], y});
        }
        cout << ans << "\n";
    }

    return 0;
}