Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 8663 | Accepted: 3501 |
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
Source
问题链接:POJ3262 Protecting the Flowers
问题简述:(略)
问题分析:
使用贪心法解决该问题。原则是每次选择的牛使得剩下的牛对花园破坏最小。
假设a,b为最先选择的2头牛,若先选a则b牛的破坏是b.d*a.t,若先选b则a牛的破坏是a.d*b.t;而不论a和b的先后,选了a和b之后,其余牛的破坏都是(a.t+b.t)*other.d。所以,每次选择的牛使得剩下的牛对花园破坏最小即可。
程序说明:(略)
题记:(略)
参考链接:(略)
AC的C++语言程序如下:
/* POJ3262 Protecting the Flowers */
#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
const int N = 1e5;
struct Cow {
int t, d;
bool operator < (const Cow& a) const {
return t * a.d < a.t * d;
}
} cow[N];
int main()
{
int n;
while(~scanf("%d", &n)) {
for(int i=0; i<n; i++)
scanf("%d%d", &cow[i].t, &cow[i].d);
sort(cow, cow + n);
long long sumd = 0, sumt = 0;
for(int i = 0; i<n; i++) {
sumd += cow[i].d * sumt;
sumt += cow[i].t * 2;
}
printf("%lld\n", sumd);
}
return 0;
}