Milk<hdoj1070>
来源:互联网 发布:淘宝倒卖赌博游戏币 编辑:程序博客网 时间:2024/06/03 08:53
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.
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct node{ char name[51];double qian,price; int v;}s[1001];bool cmp(struct node a,struct node b){ if(a.price!=b.price) return a.price <b.price ; else if(a.qian !=b.qian ) return a.qian <b.qian ; else return a.v>b.v ;}int main (){int t,n;scanf("%d",&t);while(t--){ scanf("%d",&n); for(int i=0;i<n;i++) {scanf("%s%lf%d",&s[i].name ,&s[i].qian ,&s[i].v );if(s[i].v <200){i--;n--;} } for(int i=0;i<n;i++) { if(s[i].v <1000){s[i].price =s[i].qian /(s[i].v /200);}else{s[i].price =s[i].qian /5;} } sort(s,s+n,cmp); printf("%s\n",s[0].name);}return 0;}
0 0
- Milk<hdoj1070>
- hdoj1070 Milk(简单题)
- milk
- milk
- Milk
- Milk
- Milk
- Milk
- Milk
- Milk
- Milk
- milk
- milk
- hdoj1070简单题、模拟题
- USACO:Milk
- Mix Milk
- Mixing Milk
- Mixing Milk
- HDU 1754 I Hate It【线段树入门题,单点替换,区间最值】
- mpi学习日志(9):mpi4py与Split
- Markdown语法的简要规则(for Atom)
- java之学习路线
- 再谈图的存储方式(邻接矩阵,邻接表,前向星)
- Milk<hdoj1070>
- 惯性传感器的另(qí)类(pā)应用
- 编写一个函数,将两个字符串连接起来。(不能用strcat函数)。
- UVA - 10014 Simple calculations
- 有上下界的流
- java-jni-02-Design-Overview
- centos 7 下的python psutil模块
- 剑指offer——按之字形顺序打印二叉树
- HDU - 4730 We Love MOE Girls