#include <bits/stdc++.h>
#define int long long

using namespace std;

const int N = 2E5 + 10; 
const int inf = 1E18; 

inline int read () {
    int w = 1, s = 0; char ch = getchar ();
    for (; ! isdigit (ch); ch = getchar ()) if (ch == '-') w = -1;
    for (; isdigit (ch); ch = getchar ()) s = (s << 1) + (s << 3) + (ch ^ 48);
    return s * w;
}

vector <int> all;

struct Info {
    int l, r;
    int sum = 0;
    int cnt = 0;
} tr[N * 19];

int idx = 0;

int add (int p, int l, int r, int x, int y) {
    int q = ++ idx;
    tr[q] = tr[p];
    tr[q].sum += y;
    tr[q].cnt ++;
    if (l == r) {
        return q;
    }
    int mid = (l + r) / 2;
    if (x <= mid) {
        tr[q].l = add (tr[p].l, l, mid, x, y);
    } else {
        tr[q].r = add (tr[p].r, mid + 1, r, x, y);
    }
    return q;
}

int query (int v1, int v2, int l, int r, int k) {
    if (l == r) {
        return k * all[l];
    }
    if (tr[v2].cnt - tr[v1].cnt <= k) {
        return tr[v2].sum - tr[v1].sum;
    }
    int mid = (l + r) / 2;
    int sum = tr[tr[v2].l].sum - tr[tr[v1].l].sum;
    int cnt = tr[tr[v2].l].cnt - tr[tr[v1].l].cnt;
    return sum + query (tr[v1].r, tr[v2].r, mid + 1, r, k - cnt);
}

void solve () {
	int n = read ();
	
	vector <pair <int, int>> p (n + 1);
	for (int i = 1; i <= n; i ++) {
		p[i].first = read ();
		p[i].second = read ();
		all.push_back (p[i].first);
	}
	sort (p.begin (), p.end (),
        [&] (pair <int, int> x, pair <int, int> y) {
            return x.second < y.second;
        }
    );
	
	sort (all.begin (), all.end ());
    all.erase (unique (all.begin (), all.end ()), all.end ());

	const int N = all.size ();

	auto find = [&] (int x) -> int {
        return lower_bound (all.begin (), all.end (), x) - all.begin ();// + 1;
    };

	vector <int> root (n + 1);
    for (int i = 1; i <= n; i ++) {
        root[i] = add (root[i - 1], 0, N - 1, find (p[i].first), p[i].first);
    }

    vector <int> ans (n + 1);

    auto solve = [&] (auto &&self, int al, int ar, int ql, int qr) -> void {
        if (al > ar) {
            return;
        }
        int x = (al + ar) / 2;
        int id = 0;
        int minn = inf;
        for (int i = max (x, ql); i <= qr; i ++) {
            int sum = query (root[0], root[i - 1], 0, N - 1, x - 1);
            sum += p[i].first + p[i].second;
            if (sum < minn) {
                minn = sum;
                id = i;
            }
        }
        ans[x] = minn;
        self (self, al, x - 1, ql, id);
        self (self, x + 1, ar, id, qr);
    };
    solve (solve, 1, n, 1, n);

    for (int i = 1; i <= n; i ++) {
        printf ("%lld\n", ans[i]);
    }
}

signed main () {
	// ios::sync_with_stdio (false);
    // cin.tie (nullptr);
    
	int T = 1; 
	// cin >> T;
	// T = read ();

	while (T --) {
		solve ();
	}
	
	return 0;
}