hdu 1070 Milk
2014-04-12 10:35
295 查看
Milk
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12697 Accepted Submission(s): 3076
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2 2 Yili 10 500 Mengniu 20 1000 4 Yili 10 500 Mengniu 20 1000 Guangming 1 199 Yanpai 40 10000
[align=left]Sample Output[/align]
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.
[align=left]Author[/align]
Ignatius.L
[align=left]Recommend[/align]
We have carefully selected several similar problems for you: 1076 1064 1071 1065 1248
很水的一道题了。。。
直接贴代码:
#include <map> #include <cmath> #include <vector> #include <string> #include <cstdio> #include <cstring> #include <cstdlib> #include <iostream> #include <algorithm> #define esp 1e-9 #define MAXN 10010 #define ll long long #define INF 0x7FFFFFFF #define BUG system("pause") #define SW(a,b) a^=b;b^=a;a^=b; using namespace std; int main(void){ int T; cin >> T; while(T--){ int n; int maxv = INF; int vmax = -INF; string maxstring; cin >> n; while(n--){ string str; cin >> str; int p, v; cin >> p >> v; if(v < 200) continue; int times = 0; while(v >= 200){ times++; if(times == 5) break; v -= 200; } if(maxv > p/times){ vmax = v; maxv = p/times; maxstring = str; } else if(maxv == p/times){ if(vmax <= v){ vmax = v; maxv = p/times; maxstring = str; } } } cout << maxstring << endl; } return 0; }
相关文章推荐
- 常用软件、插件名称
- (转)asp.net中获得客户端的IP地址
- 图论算法进阶习题集-500题
- 贝叶斯(Bayes)决策理论
- ConcurrentModificationException快速失败迭代器异常案例及四种解决方案
- 深入浅出JSONP--解决ajax跨域问题
- PeekMessage和GetMessage的区别
- Python基础教程(自己整理的)
- U盘数据丢失恢复教程
- CodeBlock下开发窗口出现乱码
- 【amazing cocos2d-x 3.0之十八】错误集锦
- Xcode快捷键搜集 陆续整理中
- 七周 项目6 人数不定的工资类
- ubuntu的root 如何开启
- 类定义时定义的函数与内联函数的关系
- Menu整理
- 老码农教你学英语
- Tomcat漏洞说明与安全加固
- js 小实例(时钟、延时提示框)
- 做完心脏支架手术后依然心绞痛 、胸闷气短的解决方法