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
83
84
85
86
87
88
89
90
91
92
93
94
#include <bits/stdc++.h>
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(v) (v).begin(),(v).end()
 
#define PII pair<int,int>
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define lint long long int
#define VI vector<int>
 
#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; } 
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; } 
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}
 
#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} 
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue
 
#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);}
 
 
using namespace std;

const int max_n = 1e6 + 5;

lint INF = 1e9 * 3LL * 1e9;

int n;
lint ANS[max_n];
vector< pair<lint, lint> > v;
lint VAL[max_n];
int usun[max_n];


void bruteforce() {
	FOR(i,0,n) usun[i] = 0;
	FOR(i,0,n) {
		VAL[i] = v[i].nd + v[i].st * 1LL * i;
		FOR(j,i+1,n) VAL[i] += v[j].st;
	}
	FORD(i,n-2,0) {
		lint mini = INF;
		int dla = 0;
		FOR(j, 0, n) {
			if (!usun[j]) {
				if (VAL[j] < mini) {
					mini = VAL[j];
					dla = j;
				}
			}	
		}
		ANS[i] = ANS[i+1] - VAL[dla];
		FOR(j,0,dla) VAL[j] -= v[dla].st;
		FOR(j,dla+1,n) VAL[j] -= v[j].st;
		usun[dla] = 1;
	}
}

void optimal() {
		
}

int main() {
	read(n);
	FOR(i,0,n) {
		lint a, b;
		scanf("%lld %lld", &a, &b);
		v.pb(mp(a,b));
	}
	sort(all(v));
	lint ans = 0;
	FOR(i,0,n) ans += v[i].nd + v[i].st * 1LL * i;
	ANS[n-1] = ans;
	bruteforce();	
	FOR(i,0,n) {
		printf("%lld\n", ANS[i]);
	}
}