Submission #1000916

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
 
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
 
int N;
int L[5010], R[5010];
ll ret = LLONG_MAX;
ll dp[5010][5010];
 
int main() {
	cin >> N;
	rep(i, N) cin >> L[i] >> R[i];
 
 	if (N>200) return 0;
	rep(i, N) { //fix
		vector<pii> vec;
 
		rep(j, N) {
			if (j != i) {
				vec.eb(L[j]+R[j], j);
			}
		}
 
		sort(ALL(vec));
 
		for (int l=0; l <= N-1; ++l) { // to left
			ll t = (ll)L[i] * l + (ll)R[i] * (N-1-l);
			rep(j, N) rep(k, N) dp[j][k] = LLONG_MAX;
 
			dp[0][0] = 0;

			rep(j, N-1) {
				int id = vec[j].se;
				rep(k, N) {
					if (dp[j][k] == LLONG_MAX) continue;
					dp[j+1][k+1] = min(dp[j+1][k+1], dp[j][k] + (ll)(l-1-k)*(L[id]+R[id]) + R[id]);
					dp[j+1][k] = min(dp[j+1][k], dp[j][k] + (ll)((N-1-l)-1-(j-k))*(L[id]+R[id]) + L[id]);					
				}
			}

			t += dp[N-1][l];
			ret = min(ret, t);
		}
	}
 
	cout << ret << endl;
	return 0;
}

Submission Info

Judge Result