hdu1070

Milk

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=1070

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、如果某个厂商的体积小于200，直接略过它，不放进排序数组里

2、如果某个厂商的体积超过1000，那么先把体积保存下，一旦超过，无论多大都只喝5天，所以b变为5，

然后计算下权值（每天单价）a /  b 。 3、权值从小到大排序，如果权值相同，把体积从大到小排序

（描述里要求的）。

完整代码：

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;

#pragma comment(linker, "/STACK:102400000,102400000")

typedef long long LL;
typedef double DB;
typedef unsigned uint;
typedef unsigned long long uLL;

/** Constant List .. **/ //{

const int MOD = int(1e9)+7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;

struct node
{
    char s[101];
    int w;
    int v;
}q[100001];

bool cmp(node a ,node b)
{
    if(a.w == b.w)
        return a.v > b.v;
    return a.w < b.w;
}

char ch[101];

int main()
{
    #ifdef DoubleQ
    freopen("in.txt","r",stdin);
    #endif
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        int a , b;
        int t = 0;
        for(int i = 0 ; i < n ; i ++)
        {
            scanf("%s%d%d", ch, &a , &b);
            if(b >= 200)
            {
                strcpy(q[t].s , ch);
                q[t].v = b;
                b /= 200;
                if(b > 5)
                    b = 5;
                q[t ++].w = a / b;
            }
        }
        sort(q , q + t , cmp);
        printf("%s\n",q[0].s);
    }
}