#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define ppb pop_back
#define ins insert
#define rd1(a) cin >> a
#define rd2(a, b) cin >> a >> b
#define rd3(a, b, c) cin >> a >> b >> c
#define rd4(a, b, c, d) cin >> a >> b >> c >> d
#define mkp make_pair
#define fir first
#define sec second
#define strg string
#define vct vector
#define re register
#define at auto
#define mii map<int, int>
#define mll map<ll, ll>
#define sii set<int>
#define sll set<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pci pair<char, int>
#define pic pair<int, char>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define f1(i, b) for (int i = 1; i <= b; ++i)
#define f(i, a, b) for (int i = a; i <= b; ++i)
#define fz(i, a, b) for (int i = a; i >= b; --i)
#define s(v) (int)v.size()
#define lowbit(a) a &(-a)
#define mst0(s) memset(s, 0, sizeof s)
#define mstinf(s) memset(s, 0x3f, sizeof s)
#define vct vector

const int mod = 998244353, N = 500005, INF = 1 << 30;

struct node {
    int a,b;
    bool operator < (node &y) {
        return b<y.b;
    }
} c[N];
int a[N],b[N];
int q[N];
struct segment_tree {
    int res[N<<1];
    void build(int a[],int id,int l,int r) {
        if(l==r) {
            res[id]=a[l];
            return;
        }
        int mid=l+r>>1;
        build(a,id<<1,l,mid);
        build(a,(id<<1)+1,mid+1,r);
        res[id]=min(res[id<<1],res[(id<<1)+1]);
    }
    int query(int id,int l,int r,int st,int ed) {
        if(st>r||ed<l) return 0;
        int mid=l+r>>1;
        if(st==l&&ed==r) return res[id];
        if(ed<=mid) return query(id<<1,l,mid,st,ed);
        if(st>mid) return query((id<<1)+1,mid+1,r,st,ed);
        return query(id<<1,l,mid,st,mid)+query((id<<1)+1,mid+1,r,mid+1,ed);
    }
}   x,y;

void solve() {
    int n;
    cin>>n;
    f(i,1,n) cin>>c[i].a>>c[i].b;
    sort(c+1,c+n+1);
    f(i,1,n) a[i]=c[i].a,b[i]=c[i].a-c[i].b;
    f(i,1,n) q[i]=q[i-1]+c[i].b;
    x.build(a,1,1,n);
    y.build(b,1,1,n);
    f(i,1,n) {
        int za=y.query(1,1,n,1,i)+q[i];
        int zb=x.query(1,1,n,i,n)+q[i-1];
        cout<<min(za,zb)<<'\n';
    }
}

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