hd 1070 Milk

http://acm.hdu.edu.cn/showproblem.php?pid=1070

#include <stdio.h>
#include <algorithm>
#include <cstring>
using namespace std;

struct milk{
    char name[1000];
    double money,ml;
    double val;
    int day;
}m[105];

bool cmp(milk a,milk b){
    return a.val<b.val||a.val==b.val&&a.money<b.money ||a.val==b.val&&a.ml>b.ml&&a.money==b.money;
}
int main(){
    int cas;
    int j;
    char a[1000];
    double b,c;
    scanf("%d",&cas);
    while(cas--){
        int n;
        j=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%s %lf %lf",a,&b,&c);
            if(c>=200){
                strcpy(m[j].name,a);
                m[j].money=b;
                m[j].ml=c;
                m[j].day=(int)c/200;///喝几天
                if(m[j].day>5)
                    m[j].day=5;
                m[j].val=m[j].money/m[j].day;
         ///       printf("%lf\n",m[j].val);
                j++;
            }
        }
        sort(m,m+j,cmp);
        printf("%s\n",m[0].name);
    }
    return 0;
}