1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const ll inf = 4000000000000000000LL;
const int N = 1010100;
pair<ll, ll> inp[N];
bool iny[N];
ll res[N];
int n;

int main() {
	scanf("%d", &n);
	REP(i, n) {
		scanf("%lld %lld", &inp[i].ST, &inp[i].ND);
	}
	sort(inp, inp + n);
	ll A = 0;
	REP(i, n) {
		res[n - 1] += inp[i].ND + inp[i].ST * i;
		A += inp[i].ST;
		iny[i] = true;
	}
	FORD(i, n - 1, 0) {
		// printf("runda: %d\n", i);
		res[i] = res[i + 1] - A;
		int kt = -1, poz = 0;
		ll bestVal = -inf;
		ll dot = 0;
		REP(j, n) {
			if (iny[j]) {
				dot += inp[j].ST;
				ll curVal = dot - inp[j].ST * poz - inp[j].ND;
				if (curVal > bestVal) {
					bestVal = curVal;
					kt = j;
				}
				++poz;
			}
		}
		// printf("\tnajlepszy: %d, usuwam: %lld\n", kt, bestVal);
		res[i] = res[i] + bestVal;
		iny[kt] = false;
		A -= inp[kt].ST;
	}
	REP(i, n) printf("%lld\n", res[i]);
	return 0;
}