#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=a;i<=b;++i)
using namespace std;
template<typename T>inline void ckmax(T &x,T y){x=x<y?y:x;}
template<typename T>inline void ckmin(T &x,T y){x=x>y?y:x;}
template<typename T=int>inline T read(){
	T res=0,f=1; char k;
	while(!isdigit(k=getchar())) if(k=='-') f=-1;
	while(isdigit(k)) res=res*10+k-'0',k=getchar();
	return res*f;
}
template<typename T>inline void print(T x,bool fl=1){
	if(x<0) putchar('-'),x=-x; 
	if(x>=10) print(x/10,0);
	putchar(x%10+'0');
	if(fl) putchar('\n');
}
const int N=200010,M=N*30;
int tot,f[N],ls[M],rs[M],siz[M],sum[M],rt[N],b[N],bcnt,n;
pair<int,int> v[N];
inline void insert(int &p,int pre,int l,int r,int pos){
	p=++tot; ls[p]=ls[pre],rs[p]=rs[pre];
	sum[p]=b[pos]+sum[pre],siz[p]=1+siz[pre];
	if(l==r){
		siz[p]++; sum[p]+=b[pos];
		return ;	
	}
	int mid=(l+r)>>1;
	if(pos<=mid) insert(ls[p],ls[pre],l,mid,pos);
	else insert(rs[p],rs[pre],mid+1,r,pos);
	return ;
}
inline int query(int p,int l,int r,int K){
	if(siz[p]<K) return 3e18;
	if(siz[p]==K) return sum[p];
	if(l==r) return b[l]*K;
	int mid=(l+r)>>1;
	if(siz[ls[p]]>=K) return query(ls[p],l,mid,K);
	return query(rs[p],mid+1,r,K-siz[ls[p]])+sum[ls[p]];
}
inline int calc(int x,int pos){
	return v[pos].second+b[v[pos].first]+query(rt[pos-1],1,bcnt,x-1);
}
inline void solve(int pl,int pr,int l,int r){
	ckmax(pl,l);
	assert(pr>=l);
	if(r<l) return ;
	if(pl==pr){
		for(int i=l;i<=r;++i) f[i]=pl;
		return ;
	}
	int mid=(l+r)>>1,tar=pl,vv=calc(mid,pl);
	for(int i=max(pl+1,mid);i<=pr;++i) if(calc(mid,tar)>calc(mid,i)) tar=i;
	f[mid]=tar;
	solve(pl,tar,l,mid-1);
	solve(tar,pr,mid+1,r);
	return ;
}
signed main(){
	n=read();
	for(int i=1;i<=n;++i){
		v[i].first=read(),v[i].second=read();
		b[++bcnt]=v[i].first;
	}
	sort(b+1,b+bcnt+1);
	bcnt=unique(b+1,b+bcnt+1)-b-1;
	for(int i=1;i<=n;++i) v[i].first=lower_bound(b+1,b+bcnt+1,v[i].first)-b;
	sort(v+1,v+n+1,[&](pair<int,int> x,pair<int,int>y){return x.second<y.second;});
	for(int i=1;i<=n;++i) insert(rt[i],rt[i-1],1,bcnt,v[i].first);
	solve(1,n,1,n);
	for(int i=1;i<=n;++i) print(calc(i,f[i]));
	return 0;
}