/**
 * @author : cyb1010
 * @date   : 2023-12-28 08:59:53
 * @file   : frog.cpp
 */
#include <bits/stdc++.h>
using namespace std;
#define fo(s) freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)
#define fi first
#define se second
typedef double db;
typedef long double ldb;
typedef long long ll;
typedef unsigned long long ull;
int __, n, tot, rt[200010], inf = 1e9;
ll ans[200010], llinf = 1e16;
pair<int, int> a[200010];
struct SMT {
    int l, r, cnt;
    ll sum;
} t[10000010];
int ins(int p, int l, int r, int k) {
    int tmp = ++tot;
    t[tmp] = t[p], t[tmp].cnt++, t[tmp].sum += k;
    if (l < r) {
        int mid = l + r >> 1;
        k <= mid ? t[tmp].l = ins(t[p].l, l, mid, k)
                 : t[tmp].r = ins(t[p].r, mid + 1, r, k);
    }
    return tmp;
}
ll qry(int p, int k) {
    if (t[p].cnt <= k) return t[p].sum;
    if (t[t[p].l].cnt >= k) return qry(t[p].l, k);
    return t[t[p].l].sum + qry(t[p].r, k - t[t[p].l].cnt);
}
ll w(int k, int x) {
    if (k < x) return llinf;
    return a[k].fi + a[k].se + qry(rt[k - 1], x - 1);
}
void solve(int l, int r, int lp, int rp) {
    if (l > r) return;
    int mid = l + r >> 1, pos = rp;
    ans[mid] = w(rp, mid);
    for (int i = lp; i < rp; i++) {
        ll tmp = w(i, mid);
        if (tmp < ans[mid]) ans[mid] = tmp, pos = i;
    }
    solve(l, mid - 1, lp, pos), solve(mid + 1, r, pos, rp);
}
int main() {
    // fo("frog");
    cin.tie(0)->sync_with_stdio(false);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i].se >> a[i].fi;
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++) rt[i] = ins(rt[i - 1], 1, inf, a[i].se);
    solve(1, n, 1, n);
    for (int i = 1; i <= n; i++) cout << ans[i] << "\n";
    return 0 ^ __ ^ 0;
}