#include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) (x).size())
typedef long long ll;
typedef pair<ll,ll> pii;
template<class T> void print(T & x){ cout << x; }
template<class T,class U> void print(pair<T,U> & p){cout << "("; print(p.first); cout << ", "; print(p.second); cout << ")"; }
template<class T> void print(vector<T> & v) {
  cout << "{";
  if (sz(v)) print(v[0]);
  for (int i = 1; i < sz(v); i++) cout << ", ", print(v[i]);
  cout << "}\n";
}


int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int N;
  cin >> N;
  vector<pii> A(N);
  for(int i=0; i<N; i++){
    cin >> A[i].second >> A[i].first;
  }
  sort(A.begin(), A.end());
  vector<tuple<int,int,int,int>> curI, nxtI;
  nxtI.emplace_back(1, N, 0, N-1);
  vector<ll> res(N+1);
  while(sz(nxtI)){
    curI = nxtI;
    nxtI.clear();
    multiset<ll> S;
    ll sum = 0;
    int itcnt = 0;
    auto kit = S.begin();
    for(auto [l,r,lb,rb] : curI){
      //cout << l << " " << r << " " << lb << " " << rb << " " << sz(S) << " " << itcnt << endl;
      int k = (l+r)/2;
      for(int b=itcnt+1; b<k; b++){
        S.insert(A[b-1].second);
        if(itcnt != 0 && A[b-1].second < *kit){
          ll curpiv = *kit;
          sum += A[b-1].second - curpiv;
          kit--;
        }
      }
      //cout << l << " " << r << " " << lb << " " << rb << " " << sz(S) << " " << itcnt << endl;
      while(itcnt < k-1){
        //cout << sz(S) << " " << itcnt << " " << k << endl;
        itcnt++;
        if(itcnt == 1){
          kit = S.begin();
        }
        else
          kit++;
        sum += *kit;
      }
      int bestb = max(lb, k-1);
      ll bestv = A[bestb].first + A[bestb].second + sum;
      //cout << "start " << k << " with " << bestb << " , " << bestv << endl;
      for(int b=bestb+1; b<=rb; b++){
        S.insert(A[b-1].second);
        if(itcnt != 0 && A[b-1].second < *kit){
          ll curpiv = *kit;
          sum += A[b-1].second - curpiv;
          kit--;
        }
        ll curv = A[b].first + A[b].second + sum;
        if(curv < bestv){
          bestv = curv;
          bestb = b;
        }
      }
      res[k] = bestv;
      if(l < k){
        nxtI.emplace_back(l, k-1, lb, bestb);
      }
      if(k < r){
        nxtI.emplace_back(k+1, r, bestb, rb);
      }
    }
  }
  for(int i=1; i<=N; i++){
    cout << res[i] << "\n";
  }
}