#include<bits/stdc++.h>
#define int long long
using namespace std;
const int SZ = 1e9;
const int INF = 1e16 + 7;
struct node{
	int a,b;
	bool operator <(const node& kkk)const{
		return b < kkk.b;
	}
}x[200010];
int n,tot = 0;
int rt[200010],sz[10000010],val[10000010],ls[10000010],rs[10000010],ans[200010];
void pushup(int i){
	sz[i] = sz[ls[i]] + sz[rs[i]];
	val[i] = val[ls[i]] + val[rs[i]];
}
int New(int i){
	tot++;
	sz[tot] = sz[i],val[tot] = val[i],ls[tot] = ls[i],rs[tot] = rs[i];
	return tot;
}
void upd(int& i,int l,int r,int pos,int v1,int v2){
	i = New(i);
	sz[i] += v1;
	val[i] += v2;
	if(l == r) return;
	int mid = (l + r) >> 1;
	if(pos <= mid) upd(ls[i],l,mid,pos,v1,v2);
	else upd(rs[i],mid + 1,r,pos,v1,v2);
	pushup(i);
}
int query(int i,int l,int r,int rk){
	if(!i || !rk) return 0;
	if(l == r) return l;
	int mid = (l + r) >> 1;
	if(rk <= sz[ls[i]]) return query(ls[i],l,mid,rk);
	else return val[ls[i]] + query(rs[i],mid + 1,r,rk - sz[ls[i]]);
}
void solve(int l,int r,int ql,int qr){
	if(l > r) return;
	int mid = (l + r) >> 1;
	int tl = max(ql,mid),tr = qr;
	int mn = INF,id = -1;
	for(int i = tl; i <= tr; i++){
		int tmp = x[i].b + x[i].a + query(rt[i - 1],1,SZ,mid - 1);
		if(mn > tmp) mn = tmp,id = i;
	}
	ans[mid] = mn;
	if(l == r) return;
	solve(l,mid - 1,ql,id);
	solve(mid + 1,r,id,qr); 
}
signed main(){
	scanf("%lld",&n);
	for(int i = 1; i <= n; i++) scanf("%lld %lld",&x[i].a,&x[i].b);
	sort(x + 1,x + n + 1);
	for(int i = 1; i <= n; i++) rt[i] = rt[i - 1],upd(rt[i],1,SZ,x[i].a,1,x[i].a);
	solve(1,n,1,n);	
	for(int i = 1; i <= n; i++) printf("%lld\n",ans[i]);
	return 0;
}