#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<pair<ll,ll>> v(n);
    vector<pair<ll,int>> bg;

    for (int i = 0; i < n; ++i) {
        ll a,b; cin >> a >> b;
        v[i] = {b, a};
        bg.push_back({a+b, i});
    }
    sort(v.begin(), v.end());
    sort(bg.rbegin(), bg.rend());

    priority_queue<ll, vector<ll>, greater<ll>> mi;
    priority_queue<ll> pq;
    ll sum = 0; int cnt = 0; int r = 0;
    ll mxb = 0;
    for (int i = 0; i < n; ++i) {
        if (i == r) {
            pq.push(v[r].second);
            cnt += 1;
            sum += v[r].second;
            mxb = v[r].first;
            r += 1;
        }
        else {
            cnt += 1;
            sum += mi.top();
            pq.push(mi.top());
            mi.pop();
        }

        while (bg.size()) {
            ll cur = pq.top() + mxb;
            ll u = bg.back().first;
            if (u <= cur) {
                int idx = bg.back().second;
                while (r <= idx) {
                    if (pq.top() + mxb >= v[r].first + v[r].second) {
                        sum -= pq.top(); sum += v[r].second;
                        mi.push(pq.top()); pq.pop();
                        pq.push(v[r].second);
                        mxb = v[r].first;
                    }
                    else {
                        mi.push(v[r].second);
                    }
                    r += 1;
                }
                bg.pop_back();
            }
            else break;
        }

        while (mi.size() and mi.top() < pq.top()) {
            sum -= pq.top(); sum += mi.top();
            mi.push(pq.top()); pq.pop();
            pq.push(mi.top()); mi.pop();
        }

        ll res = sum + mxb;
        cout << res << "\n";
    }
}