P2878 [USACO07JAN] Protecting the Flowers S

知识点：贪心

这个贪心的策略的分类或者说证明是属于邻项交换，看看交换当前贪心策略的次序会不会使结果变得更坏，然后注意一下溢出就行了

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

bool cmp(pair<int, int> a, pair<int, int> b) {
	return a.first * b.second < b.first * a.second;
}

int main() {
	int n;
	cin >> n;
	pair<int, int> a[N];
	for (int i = 1; i <= n; i++) {
		cin >> a[i].first >> a[i].second;
	}
	sort(a + 1, a + n + 1, cmp);
	long long ans = 0;
	long long t = a[1].first;
	for (int i = 2; i <= n; i++) {
		ans += a[i].second * t * 2;
		t += a[i].first;
	}
	cout << ans;
	return 0;
}