HDU 1070 Milk
来源:互联网 发布:网络进度计划要点 编辑:程序博客网 时间:2024/06/09 20:12
Milk
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23088 Accepted Submission(s): 6234
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
模拟搞一发
#include<iostream>#include<algorithm>#include<cstdio>using namespace std;const int inf=0x3f3f3f3f;struct Node{char str[110];int price;int volumn;double single_price;}milk[110];bool cmp(Node a,Node b){if(a.single_price==b.single_price) return a.volumn>b.volumn;return a.single_price<b.single_price;}int main(){//freopen("in.txt","r",stdin);int t;cin>>t;while(t--){int n;cin>>n;for(int i=0;i<n;i++){scanf("%s%d%d",milk[i].str,&milk[i].price,&milk[i].volumn);milk[i].single_price=milk[i].price*1.0/milk[i].volumn;if(milk[i].volumn<200) milk[i].single_price=inf;else{if(milk[i].volumn>1000) milk[i].single_price=milk[i].price*1.0/5;else milk[i].single_price=milk[i].price*1.0/(milk[i].volumn/200);}}sort(milk,milk+n,cmp);cout<<milk[0].str<<endl;}}
阅读全文
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
- js中通超链接向后台传值,中文乱码(springmvc)
- typedef和#define的区别
- 阿里云CentOS 7下配置及使用mysql
- 【Java基础14_1】正则表达式
- 函数的三个角色
- HDU 1070 Milk
- DrawerLayout的使用
- Qt 之 WAV文件属性计算(比特率、文件大小、文件时长)
- 习题三(1)
- activity_main.xml
- LeetCode【1】TwoSum
- java新手入门会犯的N个“超低级错误”
- listview_item01.xml
- 欢迎使用CSDN-markdown编辑器