（HDU）1070 --Milk( 牛奶）

这题用结构体排序外加一点贪心的思想比较好。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define max 110
using namespace std;
struct milk{
    char name[max];
    //int price;
    int v;
    int day;
    double rate;
}item[max];
bool cmp(milk a, milk b)
{
    if(a.rate < b.rate){
        return true;
    }else if(a.rate == b.rate){
        if(a.v>b.v){
            return true;
        }else{
            return false;
        }
    }else{
        return false;
    }

}

int main()
{
    //freopen("in.txt","r",stdin);
    char tname[max];
    int tprice;
    int tv;
    int t,n;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        int i;
        for(i = 0;i<n;i++){
           scanf("%s %d %d",tname,&tprice,&tv);
                //item[i].price = tprice;
                if(tv<200){
                    n--;
                    i--;
                    continue;
                }else if(tv>=1000){
                    strcpy(item[i].name,tname);
                    item[i].v = tv;
                    item[i].day = 5;
                    item[i].rate = 1.0 * tprice / 5;
                   // break;
                }else {
                    strcpy(item[i].name,tname);
                    item[i].v = tv;
                    item[i].day = tv / 200;
                    item[i].rate = 1.0 * tprice / item[i].day;
                   // break;
                }

            //}
        }
        sort(item,item+n,cmp);
        printf("%s
",item[0].name);


    }
    return 0;
}