hdu 4882 ZCC Loves Codefires 2014年多校联合第二场
来源:互联网 发布:linux 文件夹权限介绍 编辑:程序博客网 时间:2024/04/29 23:50
ZCC Loves Codefires
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1495 Accepted Submission(s): 550
Problem Description
Though ZCC has many Fans, ZCC himself is a crazy Fan of a coder, called "Memset137". 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).
Input
The first line contains an integer N(1≤N≤10^5), the number of problem in the round. 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.
Output
One integer L, the minimal score he will lose.
Sample Input
310 10 201 2 3
Sample Output
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.
求Ei*Ki的和的最大值。
典型的贪心,但是输出我整错了好几遍.wa了若干遍才反应过来。
代码:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<map>#define M 100100using namespace std;struct point{ int e; int k; double s;}p[M];bool cmp(point a,point b){ return a.s<b.s;}int main(){ int n; while(cin>>n) { for(int i=0;i<n;i++) scanf("%d",&p[i].e); for(int i=0;i<n;i++) { scanf("%d",&p[i].k); p[i].s=(double)(p[i].e)/(double)(p[i].k); } sort(p,p+n,cmp); long long ans=0,tmp=0; for(int i=0;i<n;i++) { ans+=(p[i].e+tmp)*p[i].k; tmp+=p[i].e; } printf("%I64d",ans); } return 0;}
0 0
- hdu 4882 ZCC Loves Codefires 2014年多校联合第二场
- HDU 4882 ZCC Loves Codefires(2014多校第二场1011)(贪心)
- hdu 4882 ZCC Loves Codefires
- hdu 4882ZCC Loves Codefires
- HDU 4882ZCC Loves Codefires
- HDU 4882 ZCC Loves Codefires yy
- hdu 4882 ZCC Loves Codefires(贪心)
- hdu 4882 ZCC Loves Codefires(贪心)
- HDU 4882 ZCC Loves Codefires(贪心水)
- HDU 4882 ZCC Loves Codefires(贪心)
- HDU 4882 ZCC Loves Codefires (贪心)
- HDU 4882 ZCC Loves Codefires(贪心)
- HDU 4882 ZCC Loves Codefires 还是利用率
- HDOJ 4882 ZCC Loves Codefires
- HDU 4876 ZCC loves cards (2014多校联合训练第二场1005) 解题报告(暴力+剪枝)
- hdu 4882 ZCC Loves Codefires(数学题+贪心)
- 2014 Multi-University Training Contest 2 - 1011 / hdu 4882 ZCC Loves Codefires
- hdoj 4882 ZCC Loves Codefires 【贪心】
- SVN 在线代码托管工具
- 用缓冲技术提高JSP应用的性能和稳定性之OSchche(1)
- 三大更好地给无色人工湖是人家啊
- unity3d显示小窗口
- 呼和浩特首先宣布放开房屋限购政策,成为国内省会城市中第一个放开房
- hdu 4882 ZCC Loves Codefires 2014年多校联合第二场
- 2014 Multi-University Training Contest 4小记
- Android与iOS中实现图片的拉伸与平铺
- 单例模式 常用在例如:数据库连接及其操作
- 屋限购的“吃螃蟹者”。7月10日,山东济南也宣布放开房屋限购
- 机器学习系列(8):主成分分析(PCA)及白化(ZCA)
- java中String的21种用法
- 思维导图之C++语言程序设计总结
- 为什么我要离开华尔街日报加盟Orcale