HDU4882ZCC Loves Codefires(贪心)
ZCC Loves Codefires
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 823 Accepted Submission(s): 438
It was on Codefires(CF), an online competitive programming site, that ZCC knew Memset137, and immediately became his fan.
But why?
Because Memset137 can solve all problem in rounds, without unsuccessful submissions; his estimation of time to solve certain problem is so accurate, that he can surely get an Accepted the second he has predicted. He soon became IGM, the best title of Codefires.
Besides, he is famous for his coding speed and the achievement in the field of Data Structures.
After become IGM, Memset137 has a new goal: He wants his score in CF rounds to be as large as possible.
What is score?
In Codefires, every problem has 2 attributes, let's call them Ki and Bi(Ki, Bi>0). if Memset137 solves the problem at Ti-th second, he gained Bi-Ki*Ti score. It's guaranteed Bi-Ki*Ti is always positive during the round time.
Now that Memset137 can solve every problem, in this problem, Bi is of no concern. Please write a program to calculate the minimal score he will lose.(that is, the sum of Ki*Ti).
The second line contains N integers Ei(1≤Ei≤10^4), the time(second) to solve the i-th problem.
The last line contains N integers Ki(1≤Ki≤10^4), as was described.
3 10 10 20 1 2 3
150HintMemset137 takes the first 10 seconds to solve problem B, then solves problem C at the end of the 30th second. Memset137 gets AK at the end of the 40th second. L = 10 * 2 + (10+20) * 3 + (10+20+10) * 1 = 150.
#include<stdio.h> #include<algorithm> using namespace std; struct node { int e,k; double f; }; bool cmp(node a,node b) { return a.f<b.f; } node a[100005]; int main() { int n; __int64 sumt=0,ans=0; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i].e); for(int i=0;i<n;i++) scanf("%d",&a[i].k),a[i].f=1.0*a[i].e/a[i].k; sort(a,a+n,cmp); for(int i=0;i<n;i++) { ans+=(sumt+a[i].e)*a[i].k; sumt+=a[i].e; } printf("%I64d\n",ans); }
相关文章
- poj 3262 Protecting the Flowers 贪心 牛吃花
- 最短区间----贪心
- LA 3902 Network(树上最优化 贪心)
- 数据结构与算法之美-13 贪心 分治 回溯 [MD]
- 【贪心】LeetCode 55. 跳跃游戏【中等】
- 【贪心】LeetCode 11. 盛最多水的容器【中等】
- LeetCode-1144. 递减元素使数组呈锯齿状【贪心,数组】
- LeetCode-670. 最大交换【贪心,数学】
- codeforces 204(Div.1 A) Little Elephant and Interval(贪心)
- nyoj914(二分搜索+贪心)
- 1953. 你可以工作的最大周数-贪心算法
- 1403. 非递增顺序的最小子序列-二分排序加贪心算法
- 449A - Jzzhu and Chocolate 贪心
- 贪心算法