POJ--3262--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.
输入描述:
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
输入：
6
3 1
2 5
2 3
3 2
4 1
1 6
输出：
86
题意：
有n头牛，每头牛每分钟会吃D个菜，把这头牛赶回去需要时间T(人再返回又需要T)，一次只能赶回去一头牛，也就是说剩下的牛会继续吃菜。求牛最少吃多少菜
题解：
贪心。按D/T将牛进行排序，然后计算即可。
代码：

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

const int maxn = 100000 + 5;
typedef long long ll;
struct point{
    int t,d;
    double div;
};

point a[maxn];

int cmp(point x,point y){
    return x.div > y.div;
}

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        for(int i = 0; i < n; i ++){
            scanf("%d%d",&a[i].t,&a[i].d);
            a[i].div = double(a[i].d) / double(a[i].t);
        }
        sort(a, a + n,cmp);
        ll ans = 0;
        ll sum = 0;
        for(int i = 0; i < n; i ++){
            sum += a[i].d;
        }
        for(int i = 0; i < n; i ++){
            sum -= a[i].d;
            ans += sum * 2 * a[i].t;
        }
        cout<<ans<<endl;
    }
    return 0;
}