HDU 1070 - Milk

给每种牛奶价格和量

要求买最便宜的牛奶

 #include <iostream>
 using namespace std;
 int t,n;
 char name[][];
 int cost[],v[];
 int main()
 {
     int i,ans,len;
     double minn,ave;
     scanf("%d",&t);
     while(t--)
     {
         scanf("%d",&n);
         minn=1e9;
         ans=;
         for(i=;i<=n;i++)
         {
             scanf("%s%d%d",name[i],&cost[i],&v[i]);
             if(v[i]<) continue;
             len=min(,v[i]/);
             ave=1.0*cost[i]/len;
             if(ave<minn)
             {
                 minn=ave;
                 ans=i;
             }
             else if(ave-minn<=0.0001&&minn-ave>=-0.0001)//相等的时候挑多的？
             {
                 if(v[i]>v[ans])
                 {
                     minn=ave;
                     ans=i;
                 }
             }
         }
         printf("%s\n",name[ans]);
     }
 }