#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 5;

int n, tot, rt[N], ls[N * 20], rs[N * 20], cnt[N * 20];
long long sum[N * 20], ans[N];

struct A {
	int a, b, id;
} p[N];

bool cmpa(A x, A y) {
	return x.a < y.a;
}

bool cmpb(A x, A y) {
	return x.b < y.b;
}

void modify(int &p, int q, int l, int r, int x, int v) {
	p = ++tot;
	cnt[p] = cnt[q] + 1;
	sum[p] = sum[q] + v;
	ls[p] = ls[q];
	rs[p] = rs[q];
	if (l == r) {
		return;
	}
	int mid = l + r >> 1;
	if (x <= mid) {
		modify(ls[p], ls[q], l, mid, x, v);
	} else {
		modify(rs[p], rs[q], mid + 1, r, x, v);
	}
}

long long query(int p, int l, int r, int k) {
	if (l == r) {
		return sum[p];
	}
	int mid = l + r >> 1;
	if (cnt[ls[p]] >= k) {
		return query(ls[p], l, mid, k);
	} else {
		return sum[ls[p]] + query(rs[p], mid + 1, r, k - cnt[ls[p]]);
	}
}

void solve(int l, int r, int ql, int qr) {
	int mid = l + r >> 1, k = -1;
	for (int j = max(mid, ql); j <= qr; j++) {
		int val = query(rt[j], 1, n, mid) + p[j].b;
		if (k == -1 || val < ans[mid]) {
			k = j;
			ans[mid] = val;
		}
	}
	if (l < mid) {
		solve(l, mid - 1, ql, k);
	}
	if (r > mid) {
		solve(mid + 1, r, k, qr);
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> p[i].a >> p[i].b;
	}
	sort(p + 1, p + n + 1, cmpa);
	for (int i = 1; i <= n; i++) {
		p[i].id = i;
	}
	sort(p + 1, p + n + 1, cmpb);
	for (int i = 1; i <= n; i++) {
		modify(rt[i], rt[i - 1], 1, n, p[i].id, p[i].a);
	}
	solve(1, n, 1, n);
	for (int i = 1; i <= n; i++) {
		cout << ans[i] << '\n';
	}

	return 0;
}