//#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define N 200005
#define mod 998244353
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define ld long double
#define SZ(x) (int)(x.size())
#define debug cout<<endl<<"ff"<<endl
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define fi first
#define se second
#define INF 1e9
#define pq priority_queue
#define rep(x,a,b) for(int x=a;x<=b;x++)
int qpow(int a,int b){
	int res=1;
	for(;b;b>>=1){
		if(b&1) res=res*a%mod;
		a=a*a%mod;
	}
	return res;
}
/*int fac[N],ifac[N];
int C(int n,int m){
	if(m>n||m<0||n<0) return 0;
	return fac[n]*ifac[n-m]%mod*ifac[m]%mod;
}
void init(){
	fac[0]=1;
	for(int i=1;i<N;i++) fac[i]=fac[i-1]*i%mod;
	ifac[N-1]=qpow(fac[N-1],mod-2);
	for(int i=N-2;i>=0;i--) ifac[i]=ifac[i+1]*(i+1)%mod;
}*/
/*struct node{
	int nxt,to;
}e[N<<1];
int cnt=1,head[N];
inline void add(int x,int y){
	e[++cnt].nxt=head[x];
	head[x]=cnt;
	e[cnt].to=y;
}*/
inline int lowbit(int x){return x&(-x);}
inline int read(){
  int x=0,t=1;char ch=getchar();
  while(ch<'0'||ch>'9'){
    if(ch=='-') t=-1;
    ch=getchar();
  }
    while(ch>='0'&&ch<='9'){
        x=(x<<1)+(x<<3)+(ch-'0');
        ch=getchar();
    }
    return x*t;
}
inline void write(int x){
	if(x<0) putchar('-'),x=-x;
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
int T,n,ans[N],num,rt[N];
#define ls(rt) tr[rt].ls
#define rs(rt) tr[rt].rs
#define sz(rt) tr[rt].sz
#define sum(rt) tr[rt].sum
pii a[N];
int cmp(pii a,pii b){return a.se<b.se;}
struct node{
	int ls,rs,sz,sum;
}tr[N*31];
void pushup(int rt){sum(rt)=sum(ls(rt))+sum(rs(rt));sz(rt)=sz(ls(rt))+sz(rs(rt));}
void update(int &rt,int p,int l,int r,int x){
	rt=++num;tr[rt]=tr[p];
	if(l==r){
		sz(rt)++;
		sum(rt)+=x;
		return;
	}int mid=(l+r)>>1;
	if(x<=mid) update(ls(rt),ls(p),l,mid,x);
	else update(rs(rt),rs(p),mid+1,r,x);
	pushup(rt);
}
int query(int rt,int l,int r,int res){
	if(l==r){return res*l;}
	int mid=(l+r)>>1,ans=0;
	if(sz(ls(rt))>=res) return query(ls(rt),l,mid,res);
	else return sum(ls(rt))+query(rs(rt),mid+1,r,res-sz(ls(rt)));
}
void solve(int l,int r,int x,int y){
	if(l>r) return;
	int mid=(l+r)>>1,mx=INF*INF,pos=0;
	for(int i=max(x,mid);i<=y;i++){
		int w=query(rt[i],1,INF,mid)+a[i].se;
		if(w<mx){
			mx=w;
			pos=i;
		}
	}
	ans[mid]=mx;
	solve(l,mid-1,x,pos);
	solve(mid+1,r,pos,y);
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i].fi>>a[i].se;
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++) update(rt[i],rt[i-1],1,INF,a[i].fi);
	solve(1,n,1,n);
	for(int i=1;i<=n;i++) cout<<ans[i]<<'\n';
	return 0;
}