[BZOJ] 1634: [Usaco2007 Jan]Protecting the Flowers 护花

Posted 2020-10-06 Lev今天学习了吗

1634: [Usaco2007 Jan]Protecting the Flowers 护花

Time Limit: 5 Sec  Memory Limit: 64 MB
Submit: 827  Solved: 536
[Submit][Status][Discuss]

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 cows were in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport the cows back to their barn. Each cow i is at a location that is Ti minutes (1 <= Ti <= 2,000,000) away from the 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 the barn. Moving cow i to the barn requires 2*Ti minutes (Ti to get there and Ti to return). 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只奶牛上山采木．他离开的时候，她们像往常一样悠闲地在草场里吃草．可是，当他回来的时候，他看到了一幕惨剧：牛们正躲在他的花园里，啃食着他心爱的美丽花朵！为了使接下来花朵的损失最小，约翰赶紧采取行动，把牛们送回牛棚． 牛们从1到N编号．第i只牛所在的位置距离牛棚Ti(1≤Ti《2000000)分钟的路程，而在约翰开始送她回牛棚之前，她每分钟会啃食Di(1≤Di≤100)朵鲜花．无论多么努力，约翰一次只能送一只牛回棚．而运送第第i只牛事实上需要2Ti分钟，因为来回都需要时间．    写一个程序来决定约翰运送奶牛的顺序，使最终被吞食的花朵数量最小．

Input

* 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

 

    第1行输入N，之后N行每行输入两个整数Ti和Di．

 

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

 

    约翰用6，2，3，4，1，5的顺序来运送他的奶牛．

 

Source

Silver

 

Analysis

贪心！而且这个我可以证明！qwq感动到爆炸！

为了减少损失，运走的奶牛必须是最能吃的，也就是单位进食量最大

这样，没法找到一头食量比他少的奶牛运走使得单位损失更小

就这么sort一遍，顺序确定了，后面也就简单了

 

Code

 1 #include<cstdio>
 2 #include<algorithm>
 3 #include<iostream>
 4 using namespace std;
 5 
 6 struct node{
 7     double val;
 8     long long ord,a,b;
 9 }arr[1000000];
10 
11 long long n,ret,sum[1000000];
12 
13 bool cmp(const node &a,const node &b){
14     return a.val > b.val;
15 }
16 
17 int main(){
18     scanf("%lld",&n);
19     
20     for(int i = 1;i <= n;i++){
21         long long &a = arr[i].a,&b = arr[i].b;
22         scanf("%lld%lld",&a,&b);
23         arr[i].val = 1.0*b/a/2;
24         arr[i].ord = i;
25     }
26 
27     sort(arr+1,arr+1+n,cmp);
28     
29     for(int i = 1;i <= n;i++){
30         sum[i] = sum[i-1]+arr[i].b;
31     }
32     
33     for(int i = 1;i <= n;i++){
34         ret += (sum[n]-sum[i])*arr[i].a*2;
35     }
36     
37     printf("%lld",ret);
38     
39     return 0;
40 }

112ms 贪心