Hdu 1070 MILK
来源:互联网 发布:java程序判断闰年 编辑:程序博客网 时间:2024/06/06 13:17
Milk
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17519 Accepted Submission(s): 4507
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
思路:简单的贪心题目,可惜一开始理解错了,如果体积小于200,不考虑,如果体积大于200*5,按照只能喝5天计算,算一下一天需要多少钱,求最小的那个就是,【这里要注意,如果两个单价相等的话,要按照体积最大的那个来算,坑!!明明都不能喝了还要算=-=】
AC代码如下:
#include <iostream>#include <cstring>#include <string>#include <cmath>#include <cstdio>#define eps 10e-8using namespace std; string tname; string ansname; int price,vol; double ans=10000000000.0,tprice;int main(){ int t; cin>>t; while(t--){ int n; cin>>n; int maxv=0; ans=1000000000.0; for(int i=0;i<n;i++){ cin>>tname>>price>>vol; if(vol<200) continue; if(vol>5*200)tprice=price/5.0; else tprice=price*1.0/(vol/200); if(tprice<ans){ ans=tprice; ansname=tname; maxv=vol; }else if(fabs(tprice-ans)<eps){ if(maxv<vol ){ ansname=tname; maxv=vol; } } } cout<<ansname<<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
- msdn 委托实例
- Windows下检测USB插拔的demo
- Zoho People:人事自动化的5种方式
- Java石头剪刀布小游戏代码
- hdu(5119)——滚动数组dp
- Hdu 1070 MILK
- Texas Instruments
- 前端架构,前端架构组织结构,目录结构架构
- 构建高性能web之路------mysql读写分离实战(转)
- 【BZOJ2738】矩阵乘法【整体二分】
- linux修改一个文件夹下的所有权限
- 虚函数
- 对代理模式的理解
- mysql 通过命令安装服务