Milk
2015-07-30 15:16
337 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1070
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16024 Accepted Submission(s): 4029
Problem Description
Ignatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know which kind of milk is the cheapest.
Here are some rules:
1. Ignatius will never drink the milk which is produced 6 days ago or earlier. That means if the milk is produced 2005-1-1, Ignatius will never drink this bottle after 2005-1-6(inclusive).
2. Ignatius drinks 200mL milk everyday.
3. If the milk left in the bottle is less than 200mL, Ignatius will throw it away.
4. All the milk in the supermarket is just produced today.
Note that Ignatius only wants to buy one bottle of milk, so if the volumn of a bottle is smaller than 200mL, you should ignore it.
Given some information of milk, your task is to tell Ignatius which milk is the cheapest.
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case starts with a single integer N(1<=N<=100) which is the number of kinds of milk. Then N lines follow, each line contains a string S(the length will at most 100 characters) which indicate the brand of milk, then two integers for the brand: P(Yuan)
which is the price of a bottle, V(mL) which is the volume of a bottle.
Output
For each test case, you should output the brand of the milk which is the cheapest. If there are more than one cheapest brand, you should output the one which has the largest volume.
Sample Input
Sample Output
看清题意,就可以写代码了
Milk
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16024 Accepted Submission(s): 4029
Problem Description
Ignatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know which kind of milk is the cheapest.
Here are some rules:
1. Ignatius will never drink the milk which is produced 6 days ago or earlier. That means if the milk is produced 2005-1-1, Ignatius will never drink this bottle after 2005-1-6(inclusive).
2. Ignatius drinks 200mL milk everyday.
3. If the milk left in the bottle is less than 200mL, Ignatius will throw it away.
4. All the milk in the supermarket is just produced today.
Note that Ignatius only wants to buy one bottle of milk, so if the volumn of a bottle is smaller than 200mL, you should ignore it.
Given some information of milk, your task is to tell Ignatius which milk is the cheapest.
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case starts with a single integer N(1<=N<=100) which is the number of kinds of milk. Then N lines follow, each line contains a string S(the length will at most 100 characters) which indicate the brand of milk, then two integers for the brand: P(Yuan)
which is the price of a bottle, V(mL) which is the volume of a bottle.
Output
For each test case, you should output the brand of the milk which is the cheapest. If there are more than one cheapest brand, you should output the one which has the largest volume.
Sample Input
2 2 Yili 10 500 Mengniu 20 1000 4 Yili 10 500 Mengniu 20 1000 Guangming 1 199 Yanpai 40 10000
Sample Output
Mengniu Mengniu HintIn the first case, milk Yili can be drunk for 2 days, it costs 10 Yuan. Milk Mengniu can be drunk for 5 days, it costs 20 Yuan. So Mengniu is the cheapest.In the second case, milk Guangming should be ignored. Milk Yanpai can be drunk for 5 days, but it costs 40 Yuan. So Mengniu is the cheapest.
看清题意,就可以写代码了
#include <cstdio> #include <cstring> #define maxint 1<<30 #define EP 1e-10 char name[105],ans_name[105]; int ans_v; int main() { int t,n,p,v,day; double x,ans; scanf("%d",&t); while(t--){ scanf("%d",&n); ans=maxint; for(int i=0;i<n;i++){ scanf("%s%d%d",name,&p,&v); day=v/200; if(day>5)day=5; x=(double)p/day; if(day&&x<ans){ ans=x; ans_v=v; strcpy(ans_name,name); } else if(day&&(x-ans)<EP&&ans_v<v){ ans=x; ans_v=v; strcpy(ans_name,name); } } printf("%s\n",ans_name); } return 0; }
相关文章推荐
- pcap文件格式分析
- Java compiler level does not match解决方法
- Hibernate懒加载异常
- 数据库 - 第三范式(3NF)
- 几个测试远端ip,端口,端口占用情况的命令总结
- [转]activiti5用户任务分配
- SVG实战开发学习(四)——坐标系统与坐标轴转换
- 《javascript高级程序设计》对象图
- 黑马程序员-面试题(一)-交通灯管理系统
- php实现json编码的方法
- 字符个数统计
- Oracle 学习之RMAN(五)镜像copy
- 不用安装ORACLE客户端(不执行*.exe)也能使用PL/SQL Developer的说明
- Linux - man page
- 遥感知识网站
- Linux - man page
- 秘Java虚拟机——内存管理与垃圾回收
- SQL join
- OpenGL ES
- Java中int类型和tyte[]之间转换及byte[]合并