POJ 3262 Protecting the Flowers
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 3290 | Accepted: 1332 |
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
Output
Sample Input
6 3 1 2 5 2 3 3 2 4 1 1 6
Sample Output
86
Hint
1 #include<iostream> 2 #include<cstdio> 3 #include<algorithm> 4 5 using namespace std; 6 7 typedef struct 8 { 9 int t; 10 int d; 11 } COW; 12 13 int n; 14 int sum[100010]; 15 COW cow[100010]; 16 17 bool cmp(COW a,COW b) 18 { 19 return a.t*b.d>=a.d*b.t; 20 } 21 22 int main() 23 { 24 while(cin>>n) 25 { 26 for(int i=0;i<n;i++) 27 scanf("%d %d",&cow[i].t,&cow[i].d); 28 sort(cow,cow+n,cmp); 29 sum[0]=cow[0].d; 30 for(int i=1;i<n;i++) 31 sum[i]=sum[i-1]+cow[i].d; 32 long long ans=0; 33 for(int i=n-1;i>0;i--) 34 ans+=sum[i-1]*cow[i].t*2; 35 cout<<ans<<endl; 36 } 37 38 return 0; 39 }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步