POJ-3262-Protecting the Flowers

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 T_i minutes (1 ≤ T_i ≤ 2,000,000) away from its own barn. Furthermore, while waiting for transport, she destroys D_i (1 ≤ D_i ≤ 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 × T_i minutes (T_i to get there and T_i 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,  T_i and  D_i, 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头奶牛跑到FJ的花园里去吃花儿了，它们分别在距离牛圈T分钟处吃花儿，每分钟会吃掉D朵卡哇伊的花儿，（此处有点拗口，不要在意细节啊！），FJ现在要将它们给弄回牛圈，但是他每次只能弄一头回去，来回用时总共为2*T分钟，在这段时间内，其它的奶牛会继续吃FJ卡哇伊的花儿，速度保持不变，当然正在被赶回牛圈的奶牛就没口福了！现在要求以一种最棒的方法来尽可能的减少花儿的损失数量，求奶牛吃掉花儿的最少朵数！

思路：

这个题的关键在于如何排序，不能单独只以时间排序或者食花量排序，而是应该综合二者进行排序！

可以根据T*1.0/D进行升序排序，或者根据D*1.0/T进行降序排序，亦或根据T*D进行升序排序！为什么酱紫排呢，因为这样能保证每次做出的选择都是损失最小的！

证明:
二个羊中 A,B,属性分别为分别为eatA,timeA,eatB,timeB
选A的时候损失timeA*eatB
选B的时候损失timeB*eatA
双方同除以eatA*eatB.
令time/eat为一个羊的比率x
可以证明x小的那个为最优解. 

代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct cows
{
    int t,d;
} cow[201314];
int cmp(cows a,cows b)
{
    return ((a.t*1.0)/a.d)<((b.t*1.0)/b.d);
}
int main()
{
    int n;
    long long sum=0,min=0;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        scanf("%d%d",&cow[i].t,&cow[i].d);
        sum+=cow[i].d;
    }
    sort(cow,cow+n,cmp);
    //printf("............\n");
    //for(int i=0;i<n;i++)
    //printf("%d  %d\n",cow[i].t,cow[i].d);
    for(int i=0; i<=n-1; i++) //最后一组数据是无需计算破坏的！
    {
        sum-=cow[i].d;
        //printf("破坏：%d\n",cow[i].t*2*sum);
        min+=cow[i].t*2*sum;
    }
    printf("%lld\n",min);
    return 0;
}