#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+5;

int n;
int pa[N],pb[N];
struct node{
    int a,b,id;
    bool operator<(const node &e)const {
        if(b==e.b) return a<e.a;
        return b<e.b;
    }
}p[N];
bool st[N],vis[N];
void solve()
{
    cin>>n;
    priority_queue<pair<int,int> >p1;
    priority_queue<pair<int,int> >p2;
    for(int i=1;i<=n;i++){
        cin>>p[i].a>>p[i].b;
        pa[i]=p[i].a,pb[i]=p[i].b;
        p1.push({-(p[i].a+p[i].b),i});
        p[i].id=i;
    }
    sort(p+1,p+1+n);
    int maxb=0,ans=0,pp=1;
    for(int i=1;i<=n;i++){
        int t1=2e9+5,t2=t1,maxt=0,id1,id2;
        while(!p1.empty()){
            int id=p1.top().second;
            if(st[id]) {
                //p2.push({-pa[id],id});
                p1.pop();
            }//该数b小于maxb，实际贡献在p2中
            else if(vis[id]) p1.pop();
            else {
                t1=-(p1.top().first)-maxb;
                id1=id;
                //maxt=max(pb[id],maxt);
                //p1.pop();
                break;
            }
        }
        while(!p2.empty()){
            int id=p2.top().second;
            if(vis[id]) {
                p2.pop();
                continue;
            }
            t2=pa[id];
            id2=id;
            //p2.pop();
            break;
        } 
        if(t1<=t2){
            ans+=t1;
            maxb=max(pb[id1],maxb);
            vis[id1]=1;
            p1.pop();
        }
        else ans+=t2,vis[id2]=1,p2.pop();
        //cout<<t1<<" "<<t2<<endl;
        cout<<ans<<endl;
        while(pp<=n&&p[pp].b<maxb) {
            if(!vis[p[pp].id])
            p2.push({-p[pp].a,p[pp].id});
            st[p[pp].id]=1;
            pp++;

        }
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int T=1;
    while(T--) solve();
    return 0;
}