杭电oj--1070 ( Milk )--贪心算法

最新推荐文章于 2020-01-27 20:58:53 发布

源……

最新推荐文章于 2020-01-27 20:58:53 发布

阅读量561

点赞数

分类专栏： ACM 文章标签：杭电oj

本文链接：https://blog.csdn.net/weixin_44008482/article/details/84887494

版权

ACM 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

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.

#include<stdio.h>
#include<string.h>
struct milk{  //milk结构体x为价格，y为净含量
    int x;
    int y;
}f[100];

int main()
{
    int n,k,i,j;
    double c[101];    //c数组用来储存各牛奶性价比 
    char a[101][101];   //a数组用来储存牛奶名字
    scanf("%d",&n);
    while(n--){
        memset(c,0,100);   //c清零
        scanf("%d",&k);
        for(i=0;i<k;i++){   //输入牛奶信息
            scanf("%s",&a[i]);
            scanf("%d %d",&f[i].x,&f[i].y);
            getchar();
        }
        for(i=0;i<k;i++){
            if(f[i].y>=1000){   //净含量多于1000的按1000计算性价比
                c[i]=1000.0/f[i].x;
            }
            if(f[i].y<1000){    //净含量少于1000的计算最多能喝多少天再计算性价比
                for(j=1;j<=5;j++){   
                    if(f[i].y<(200*j)){
                        c[i]=200.0*(j-1)/f[i].x;
                        break;
                    }
                }
            }
        }
        for(i=1,j=0;i<k;i++){    //查找最性价比最高也就是最便宜的牛奶编号
            if(c[j]<=c[i]){
                if(c[j]==c[i]){
                    if(f[j].y<f[i].y)
                        j=i;
                }
                else{
                    j=i;
                }
            }
        }
        printf("%s\n",a[j]);
    }
    return 0;
}