HDU 1070.Milk【最优解】【10月5】

Milk

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.

 

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.

 

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

   
   
   
   

    
    
    
    2
2
Yili 10 500
Mengniu 20 1000
4
Yili 10 500
Mengniu 20 1000
Guangming 1 199
Yanpai 40 10000
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    Mengniu
Mengniu


    
    
    
    
 
     
 
      Hint 
     
In 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. 
    
    
    
    
     
   
   
   
   
   
   
   
   

    
    
    
     
   
   
   
   

处理好这几个条件就好：

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).（只喝5天之内的牛奶。如果一盒牛奶超过1000ml，那也只喝5天）
2. Ignatius drinks 200mL milk everyday.（一天喝200ml牛奶）
3. If the milk left in the bottle is less than 200mL, Ignatius will throw it away.（如果瓶子里不够200ml，就不喝了）
4. All the milk in the supermarket is just produced today.（所有牛奶都是当天产的）

代码如下：

#include<iostream>
#include<cstdio>
using namespace std;
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        int n,price,vml,maxvml=0;
        double predaycost=100000000;
        string name,ans;
        scanf("%d",&n);
        while(n--){
            cin>>name;
            scanf("%d%d",&price,&vml);
            double xdaycost;
            if(vml>=1000)   xdaycost=(double)price/5;//只喝5天
            else if(vml>=200)   xdaycost=(double)(price/(vml/200));
            else continue;//还不够1天的，直接不要了
            if(xdaycost<predaycost||(xdaycost==predaycost&&vml>maxvml)){
                predaycost=xdaycost;
                maxvml=vml;
                ans=name;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}