Protecting the Flowers

Protecting the Flowers

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 10543		Accepted: 4290

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 destroys Di (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

Line 1: A single integer N 
Lines 2..N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow's characteristics

Output

Line 1: A single integer that is the minimum number of destroyed flowers

Sample Input

6
3 1
2 5
2 3
3 2
4 1
1 6

Sample Output

86

Hint

FJ returns the cows in the following order: 6, 2, 3, 4, 1, 5. While he is transporting cow 6 to the barn, the others destroy 24 flowers; next he will take cow 2, losing 28 more of his beautiful flora. For the cows 3, 4, 1 he loses 16, 12, and 6 flowers respectively. When he picks cow 5 there are no more cows damaging the flowers, so the loss for that cow is zero. The total flowers lost this way is 24 + 28 + 16 + 12 + 6 = 86.

题意： 约翰留下他的N只奶牛上山采木．他离开的时候，她们像往常一样悠闲地在草场里吃草．可是，当他回来的时候，他看到了一幕惨剧：牛们正躲在他的花园里，啃食着他心爱的美丽花朵！为了使接下来花朵的损失最小，约翰赶紧采取行动，把牛们送回牛棚． 牛们从1到N编号．第i只牛所在的位置距离牛棚Ti(1≤Ti<2000000)分钟的路程，而在约翰开始送她回牛棚之前，她每分钟会啃食Di(1≤Di≤100)朵鲜花．无论多么努力，约翰一次只能送一只牛回棚．而运送第第i只牛事实上需要2Ti分钟，因为来回都需要时间．    写一个程序来决定约翰运送奶牛的顺序，使最终被吞食的花朵数量最小．

思路：一道比较特殊的贪心。设之前农夫已经花了x分钟运牛，现在在i，j两头牛之间选择该运那到牛，如果先运i，则需要花费的时间是（x+2*Ti*Dj），如果先运j，则需要花费的时间是（x+2*Tj*Di）.比较大小就行了。

#include<iostream>
#include<algorithm>
using namespace std;
struct Node{
    long long d;
    long long t;
}node[100100];
bool cmp(Node a,Node b){
    return a.d*b.t>b.d*a.t;
}
int main(){
    long long n;
    cin>>n;
    for(long long i=0;i<n;i++){
        cin>>node[i].t>>node[i].d;
    }
    sort(node,node+n,cmp);
    long long ans=0;
    long long time=0;
    for(long long i=0;i<n;i++){
        ans+=time*node[i].d;
        time+=2*node[i].t;
    }
    cout<<ans<<endl;
}