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
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define inf 1000000000
#define INF 1000000000000000000LL
#define VI vector<int>
#define VLL vector<ll>
#define PII pair<int, int>
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define endl '\n'
#define REP(x, y) for(int x = 0; x < (y); ++x)
#define FOR(x, y, z) for(int x = y; x <= (z); ++x)
using namespace std;

#define N 1000007
#define max(a, b) (a>b?a:b)

int n;

ll a[N];

ll b[N];

ll dp[2][N];

vector<int> s;

bool comp(int p, int q)
{
	return a[p]<a[q];
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);

	cin >> n;

	for(int i = 1; i <= n; ++i)
	{
		cin >> a[i] >> b[i];
		s.pb(i);
	}

	sort(s.begin(), s.end(), comp);

	for(int i = 1; i <= n; ++i)
	{
		for(int k = 1; k <= i; ++k)
		{
			dp[1][k] = max(dp[0][k], dp[0][k-1]+b[s[i-1]]+a[s[i-1]]*(k-1));
		}

		for(int k = 1; k <= i; ++k)
		{
			dp[0][k] = dp[1][k];
		}
	}

	for(int i = 1; i <= n; ++i)
	{
		cout << dp[0][i] << endl;
	}
}