Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 8008 | Accepted: 3238 |
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
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
题意:牛在一片花圃里 每头牛都会吃花 给出搬运每头牛回牛舍需要的时间和每头牛吃花的速度 求花的最少损失
思路:贪心 先搬运单位时间内吃花最多的牛
#include <iostream>
#include <cstdio>
#include <queue>
#define ll long long
#define max_ 100010
using namespace std;
int n;
ll sum,s;
struct z
{
int t;
int d;
double sd;
bool operator < (const z &a)const
{
return a.sd<sd;
}
}cow[max_];
int main()
{
scanf("%d",&n);
int i;
priority_queue<struct z>q;
for(i=1;i<=n;i++)
{
scanf("%d%d",&cow[i].t,&cow[i].d);
cow[i].sd=cow[i].d*1.0/cow[i].t;
q.push(cow[i]);
sum+=(ll)cow[i].t;
}
sum-=q.top().t;
for(i=1;i<n;i++)
{
s=s+sum*q.top().d;
q.pop();
sum=sum-q.top().t;
}
ll o=2*s;
cout<<o<<endl;
}