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.

2

2

Yili 10 500

Mengniu 20 1000

4

Yili 10 500

Mengniu 20 1000

Guangming 1 199

Yanpai 40 10000 

Mengniu

Mengniu 

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<cstdio>

 #include<algorithm>

 using namespace std;

 struct nam

 {

     int v;

     float y;

     char a[];

 } milk[];

 bool f(nam a,nam b)

 {

     double ka,kb;

     int da,db;

     da=(a.v/)>?:(a.v/);

     db=(b.v/)>?:(b.v/);

     ka=a.y*1.0/da;

     kb=b.y*1.0/db;

     if(ka!=kb) return ka<kb;

     else

     return a.v>b.v;

 }

 int main()

 {

     int t,n;

     scanf("%d",&t);

     while(t--)

     {

         scanf("%d",&n);

         for(int i=;i<n;i++)

         {

         scanf("%s %f %d",&milk[i].a,&milk[i].y,&milk[i].v);

         if(milk[i].v<)

         {

             i--;

             n--;

         }

         }

         sort(milk,milk+n,f);

         printf("%s\n",milk[].a);

    }

 }