[USACO07JAN]保护花朵（贪心策略）

P2878 [USACO07JAN]保护花朵

Protecting the Flowers

题目描述
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.

有n头奶牛跑到FJ的花园里去吃花儿了，它们分别在距离牛圈T分钟处吃花儿，每分钟会吃掉D朵卡哇伊的花儿，（此处有点拗口，不要在意细节啊！），FJ现在要将它们给弄回牛圈，但是他每次只能弄一头回去，来回用时总共为2*T分钟，在这段时间内，其它的奶牛会继续吃FJ卡哇伊的花儿，速度保持不变，当然正在被赶回牛圈的奶牛就没口福了！现在要求以一种最棒的方法来尽可能的减少花儿的损失数量，求奶牛吃掉花儿的最少朵数！

输入输出格式

输入格式：
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

输出格式：
Line 1: A single integer that is the minimum number of destroyed flowers

输入输出样例

输入样例#1：
6
3 1
2 5
2 3
3 2
4 1
1 6
输出样例#1：
86
说明

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.

思路

这个题是一道贪心策略题，我们从一开始来分析：
对于一个接送奶牛的序列，我们对相邻两个奶牛之间互换这样的操作来使之最优。
对于a，b两头奶牛，原序列是ab，如果交换，那么对序列的贡献是da * tb，如果不换，那么对序列的贡献就是db * ta，也就是说交换的条件是da * tb>db * ta，即da / ta > db / tb，所以我们需要让da / ta大的先被牵走，这就是本题的贪心策略。

代码

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;

int i,j,m,n;
long long aans;

struct data
{
    int t,d;
}a[100001];

int r()
{
    int ans=0,f=1;
    char ch;
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
        {
            f=-1;
        }
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        ans*=10;
        ans+=ch-'0';
        ch=getchar();
    }
    return ans*f;
}

int cmp(data aa,data bb)
{
    if((double)aa.d/(double)aa.t>(double)bb.d/(double)bb.t) return 1;
    return 0;
}

int main()
{
    n=r();
    long long sum=0;
    for(i=1;i<=n;i++)
    {
        a[i].t=r();
        a[i].d=r();
        sum+=a[i].d;
    }
    sort(a+1,a+n+1,cmp);


    for(i=1;i<=n;i++)
    {
        sum-=a[i].d;
        aans+=(a[i].t*2)*sum;
    }
    cout<<aans;
}