#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int N=2e5+3,M=1e9;
int n;
pii a[N];

int rt=0,tot=0,lc[N*40],rc[N*40],s[N*40];
ll sum[N*40];
void upd(int& x,int l,int r,int p,int v){
    if(!x)x=++tot;
    s[x]+=v,sum[x]+=p*v;
    if(l==r)return;
    int mid=(l+r)>>1;
    if(p<=mid)upd(lc[x],l,mid,p,v);
    else upd(rc[x],mid+1,r,p,v);
}
ll qry(int x,int l,int r,int p){
    if(l==r)return s[x];
    int mid=(l+r)>>1;
    if(p<=mid)return qry(lc[x],l,mid,p);
    return sum[lc[x]]+qry(rc[x],mid+1,r,p);
}
int kth(int x,int l,int r,int k){
    if(l==r)return l;
    int mid=(l+r)>>1;
    if(k<=s[lc[x]])return kth(lc[x],l,mid,k);
    return kth(rc[x],mid+1,r,k-s[lc[x]]);
}

ll c[N],ans[N];
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    cin>>n;
    for(int i=1;i<=n;++i)cin>>a[i].second>>a[i].first;
    sort(a+1,a+n+1);
    for(int i=2;i<=n;++i)c[i]=a[i].second-a[i].first+a[i-1].first;
    for(int i=1;i<=n;++i)upd(rt,1,M,a[i].second,1);
    int j=1;
    for(int i=n;i>=2;--i){
        while(j<=n-1){
            int pos=kth(rt,1,M,j+1);
            if(pos<=c[i])ans[j]=qry(rt,1,M,pos)+a[i].first,++j;
            else break;
        }
        upd(rt,1,M,a[i].second,-1);
    }
    ll ss=0;
    for(int i=1;i<=j-1;++i)ss+=a[i].second;
    for(int i=j;i<=n;++i){
        ss+=a[i].second;
        ans[i]=ss+a[i].first;
    }
    for(int i=1;i<=n;++i)cout<<ans[i]<<'\n';
}