/**
 * @author : cyb1010
 * @date   : 2024-11-07 11:07:20
 * @file   : sales.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
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) int(v.size())
typedef double db;
typedef long double ldb;
typedef long long ll;
typedef unsigned long long ull;
void ckmx(int &x, int y) { x < y && (x = y); }
void ckmn(int &x, int y) { x > y && (x = y); }
const int N = 200010, V = 1e9 + 10;
const ll inf = 1e16;
int __, n;
ll f[N];
pair<int, int> a[N];

struct node {
    int l, r, cnt;
    ll sum;
} t[N * 31];
int rt[N], tot;
int ins(int p, int l, int r, int k) {
    int res = ++tot, mid = l + r >> 1;
    t[res] = t[p], t[res].cnt++, t[res].sum += k;
    if (l < r)
        k <= mid ? (t[res].l = ins(t[p].l, l, mid, k))
                 : (t[res].r = ins(t[p].r, mid + 1, r, k));
    return res;
}
ll qsum(int p, int l, int r, int k) {
    if (l == r) return k * l;
    int mid = l + r >> 1;
    if (t[t[p].l].cnt >= k) return qsum(t[p].l, l, mid, k);
    return t[t[p].l].sum + qsum(t[p].r, mid + 1, r, k - t[t[p].l].cnt);
}

ll qry(int x, int y) { return a[x].fi + qsum(rt[x], 0, V, y); }
void solve(int l, int r, int L, int R) {
    if (l > r) return;
    int mid = l + r >> 1, pos = 0;
    for (int i = max(L, mid), v; i <= R; i++)
        if ((v = qry(i, mid)) < f[mid]) f[mid] = v, pos = i;
    solve(l, mid - 1, L, pos), solve(mid + 1, r, pos, R);
}
int main() {
    // fo("sales");
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    // for (int i = 1; i <= n; i++) cin >> a[i].fi;
    // for (int i = 1; i <= n; i++) cin >> a[i].se;
    for (int i = 1; i <= n; i++) cin >> a[i].se >> a[i].fi;
    sort(a + 1, a + 1 + n), fill(f + 1, f + 1 + n, inf);
    for (int i = 1; i <= n; i++) rt[i] = ins(rt[i - 1], 0, V, a[i].se);
    solve(1, n, 1, n);
    for (int i = 1; i <= n; i++) cout << f[i] << '\n';
    return 0 ^ __ ^ 0;
}