1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include<bits/stdc++.h>
using namespace std;

const int MX = 7005;
long long dp[MX][MX];
int n;
pair<long long,long long> a[MX];

int main()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; ++ i)
		scanf("%lld%lld", &a[i].first, &a[i].second);
	sort(a+1,a+n+1);
	
	for (int i = 1; i <= n; ++ i)
		for (int j = 1; j <= n; ++ j)
			dp[i][j] = max(dp[i][j-1] , dp[i-1][j-1] + a[j].first*(i-1) + a[j].second);
			
	for (int i = 1; i <= n; ++ i)
		printf("%lld\n", dp[i][n]);
	
	return 0;
}