Description
Farmer John went to cut some wood and left N (2 ≤ N ≤ 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cluster of cows was in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport each cow back to its own barn.
Each cow i is at a location that is Ti minutes (1 ≤ Ti ≤ 2,000,000) away from its own barn. Furthermore, while waiting for transport, she destroysDi (1 ≤ Di ≤ 100) flowers per minute. No matter how hard he tries, FJ can only transport one cow at a time back to her barn. Moving cow i to its barn requires 2 × Ti minutes (Ti to get there and Ti to return). FJ starts at the flower patch, transports the cow to its barn, and then walks back to the flowers, taking no extra time to get to the next cow that needs transport.
Write a program to determine the order in which FJ should pick up the cows so that the total number of flowers destroyed is minimized.
Input
Lines 2.. N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow's characteristics
Output
Sample Input
6 3 1 2 5 2 3 3 2 4 1 1 6
Sample Output
86
Hint
/*
这题其实就是说有n头牛,分别要用t分钟运走,而在这些时间之内
还在原位置的牛会搞破坏,所以就直接用破坏/时间来衡量破坏度,
再按破坏度由大到小排序就会是最小破坏了。
*/
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<cmath>
#include<ctime>
#include<cstdlib>
#include<queue>
#include<vector>
#include<set>
using namespace std;
const int T=155000;
#define inf 0x3f3f3f3fL
typedef long long ll;
struct node
{
int t,d;
double v;
node(){}
node(int _t,int _d,int _v):t(_t),d(_d),v(_v){}
bool operator<(const node& a)const{
return v>a.v;
}
}a[T];
ll s[T];
int main()
{
#ifdef zsc
freopen("input.txt","r",stdin);
#endif
int n,m,i,j,k;
ll sum = 0;
while(~scanf("%d",&n))
{
sum = 0;
memset(s,0,sizeof(s));
for(i=0;i<n;++i){
scanf("%d%d",&a[i].t,&a[i].d);
a[i].v = a[i].d*1.0/a[i].t;
}
sort(a,a+n);
for(i=n-1;i>=0;--i){
s[i] = s[i+1]+a[i].d;
}
for(i=0;i<n;++i){
sum += 2*a[i].t*(s[i]-a[i].d);
}
printf("%lld\n",sum);
}
return 0;
}