hdu 1070 Milk
来源:互联网 发布:自学c语言夏老师视频 编辑:程序博客网 时间:2024/05/19 04:29
Milk
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12697 Accepted Submission(s): 3076
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.
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.
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
22Yili 10 500Mengniu 20 10004Yili 10 500Mengniu 20 1000Guangming 1 199Yanpai 40 10000
Sample Output
MengniuMengniuHintIn 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.
Author
Ignatius.L
Recommend
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;}
0 0
- hdu 1070 Milk(水)
- 水题 hdu 1070 milk
- HDU 1070 Milk
- hdu 1070 Milk
- hdu 1070 milk
- Milk hdu 1070
- hdu 1070 Milk
- hdu 1070 Milk
- hdu 1070 Milk
- HDU 1070 Milk
- hdu 1070 Milk
- Milk hdu 1070
- hdu 1070 Milk
- hdu 1070 Milk
- hdu-oj 1070 Milk
- HDU 1070 Milk
- hdu 1070 milk
- HDU 1070 Milk
- 【P000-005】交易费计算系统,1.0正式版
- js 笔记 定时器
- 图论算法进阶习题集-500题
- 从二叉查找树到平衡二叉树再到红黑树
- U盘数据丢失恢复教程
- hdu 1070 Milk
- 行人检测(Pedestrian Detection)资源
- 最长公共子序列打印路径
- linux内核分析--中断的分类
- hdu 1071 The area
- 有向图邻接表表示及反向图构造
- 兰州工地被殴农民工:曾有人报警 未见警车到来
- Ackerman函数
- 磁盘格式转换