#include <bits/stdc++.h>

const int maxn = 2e5, maxlg = 18, maxa = 1e9;

std::array<int, maxn + 1> a, b;
std::array<long long, maxn + 1> ans;
std::vector<int> vb;
std::array<std::vector<int>, maxn + 1> va;

namespace segt {
  int tot;
  std::array<int, maxn + 1> rt;

  struct node {
    int cnt, ls, rs;
    long long sum;
  };
  std::array<node, maxn * (maxlg + 1) + 1> t;

  void modify(int &x, int o, int p, int l = 1, int r = maxa) {
    t[x = ++tot] = t[o];
    ++t[x].cnt;
    t[x].sum += p;
    if (l < r) {
      int mid = (l + r) / 2;
      if (p <= mid)
        modify(t[x].ls, t[o].ls, p, l, mid);
      else
        modify(t[x].rs, t[o].rs, p, mid + 1, r);
    }
  }

  long long query(int x, int k, int l = 1, int r = maxa) {
    if (k > t[x].cnt)
      return std::numeric_limits<long long>().max() / 2;
    if (l == r)
      return (long long)k * l;
    
    int mid = (l + r) / 2;
    if (k <= t[t[x].ls].cnt)
      return query(t[x].ls, k, l, mid);
    else
      return t[t[x].ls].sum + query(t[x].rs, k - t[t[x].ls].cnt, mid + 1, r);
  }
}

void solve(int bl, int br, int kl, int kr) {
  int mid = (kl + kr) / 2, pos = bl;
  auto calc = [&](int x) {
    return vb[x - 1] + segt::query(segt::rt[x], mid);
  };
  ans[mid] = calc(pos);
  long long tmp;
  for (int i = bl + 1; i <= br; ++i)
    if ((tmp = calc(i)) < ans[mid]) {
      ans[mid] = tmp;
      pos = i;
    }

  if (kl <= mid - 1)
    solve(bl, pos, kl, mid - 1);
  if (mid + 1 <= kr)
    solve(pos, br, mid + 1, kr);
}

int main() {
  #ifndef ONLINE_JUDGE
    std::freopen("L.in", "r", stdin);
    std::freopen("L.out", "w", stdout);
  #endif
  std::cin.tie(nullptr)->sync_with_stdio(false);

  int n;
  std::cin >> n;
  for (int i = 1; i <= n; ++i) {
    std::cin >> a[i] >> b[i];
    vb.push_back(b[i]);
  }
  std::sort(vb.begin(), vb.end());
  vb.erase(std::unique(vb.begin(), vb.end()), vb.end());
  for (int i = 1; i <= n; ++i)
    va[std::lower_bound(vb.begin(), vb.end(), b[i]) - vb.begin() + 1].push_back(a[i]);
  for (int i = 1; i <= (int)vb.size(); ++i) {
    segt::rt[i] = segt::rt[i - 1];
    for (int j : va[i])
      segt::modify(segt::rt[i], segt::rt[i], j);
  }
  
  solve(1, (int)vb.size(), 1, n);

  for (int i = 1; i <= n; ++i)
    std::cout << ans[i] << '\n';
  return 0;
}