贪心策略说实话,可能做的多了有点感觉,首先下意识地会感觉如果能尽量能将每分钟吃的最多的那头牛赶走就能使得损失尽量少,但是是不可能根据D来排序的,因为毕竟还有时间,如果一头牛要赶1000分钟,就算这头牛每分钟只吃1根草也要先赶走他,所以可以知道就是单位时间吃草尽量大的先驱逐,避免精度比较大小时用乘法。
AC代码:
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <bitset>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <fstream>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <iostream>
#include <algorithm>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
#define maxn 1010
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ms(x,y) memset(x,y,sizeof(x))
#define rep(i,n) for(int i=0;i<(n);i++)
#define repf(i,a,b) for(int i=(a);i<=(b);i++)
#define pii pair<int,int>
//#define mp make_pair
#define FI first
#define SE second
#define IT iterator
#define PB push_back
#define Times 10
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int ,int > P;
const double eps = 1e-10;
const double pi = acos(-1.0);
const ll mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const ll INF = (ll)1e18+300;
const int maxd = 100500 + 10;
struct node{
ll t, d;
};
node ac[maxd];
bool cmp(node a, node c) {
return a.t * c.d < c.t * a.d;
}
int main() {
int n;
cin >> n;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> ac[i].t >> ac[i].d;
sum += ac[i].d;
}
sort(ac, ac+n, cmp);
ll ans = 0;
for (int i = 0; i < n; i++) {
//cout << ac[]
sum -= ac[i].d;
//cout << sum << " " << ans << endl;
ans += sum * ac[i].t * 2;
//sum -= ac[]
}
cout << ans << endl;
}