#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int kmax = 2e5 + 3;

struct V {
  int a, b;
} v[kmax];

struct Tree {
  int ls, rs;
  int ct;
  long long sum;
} tr[kmax << 5];

int n, tc;
int b[kmax], tot;
int rt[kmax];
long long res[kmax];

void Insert(int &x, int y, int l, int r, int k, int v) {
  x = ++tc;
  tr[x] = tr[y];
  tr[x].ct++, tr[x].sum += v;
  if(l == r) return;
  int mid = (l + r) >> 1;
  if(k <= mid) {
    Insert(tr[x].ls, tr[y].ls, l, mid, k, v);
  } else {
    Insert(tr[x].rs, tr[y].rs, mid + 1, r, k, v);
  }
}

long long Query(int x, int l, int r, int k) {
  if(!k || !x) return 0;
  if(l == r) return tr[x].sum;
  int mid = (l + r) >> 1;
  if(tr[tr[x].ls].ct <= k) return tr[tr[x].ls].sum + Query(tr[x].rs, mid + 1, r, k - tr[tr[x].ls].ct);
  return Query(tr[x].ls, l, mid, k);
}

long long Calc(int x, int k) {
  if(k > x) return 1e18;
  return Query(rt[x], 0, n, k);
}

void Solve(int l, int r, int _l, int _r) {
  if(l > r) return;
  int mid = (l + r) >> 1, _mid = -1;
  res[mid] = 1e18;
  // cout << "mid = " << mid << '\n';
  for(int i = _l; i <= _r; i++) {
    long long tot = Calc(i - 1, mid - 1) + v[i].a + v[i].b;
    if(res[mid] > tot) {
      res[mid] = tot;
      _mid = i;
    }
  }
  Solve(l, mid - 1, l, _mid);
  Solve(mid + 1, r, _mid, _r);
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n;
  for(int i = 1; i <= n; i++) {
    cin >> v[i].a >> v[i].b;
    b[++tot] = v[i].a;
  }
  sort(v + 1, v + n + 1, [](V p, V q) { return p.b < q.b || p.b == q.b && p.a < q.a; });
  sort(b + 1, b + tot + 1);
  tot = unique(b + 1, b + tot + 1) - b - 1;
  for(int i = 1; i <= n; i++) {
    int pos = lower_bound(b + 1, b + tot + 1, v[i].a) - b;
    Insert(rt[i], rt[i - 1], 0, n, pos, v[i].a);
  }
  Solve(1, n, 1, n);
  for(int i = 1; i <= n; i++) {
    cout << res[i] << '\n';
  }
  return 0;
}