#include<stdio.h>
#include<algorithm>
using namespace std;
struct milk
{
char pp[110];
double jg;
int tj;
};
milk milks[110];
bool cmp(milk a,milk b)
{
if(a.jg!=b.jg)
return a.jg<b.jg;
else
return a.tj>b.tj;
}
int main()
{
int t,n;
int i,j,k,l,dj;
double sum;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",milks[i].pp);
scanf("%d%d",&dj,&milks[i].tj);
j=milks[i].tj;
for(k=1;;k++)
{
j-=200;
/* for(1;2;3)
4;
运行顺序:1-->2-->4-->3-->2 */
}
if(j<200)
break;
if(k==5)
break;
}
sum=0;
if(milks[i].tj<200)
sum=-1;
else
sum=dj/(k*1.0);
milks[i].jg=sum;
}
sort(milks,milks+n,cmp);
for(i=0;;i++)
if(milks[i].jg>0)
break;
printf("%s\n",milks[i].pp);
}
return 0;
}
#include<algorithm>
using namespace std;
struct milk
{
char pp[110];
double jg;
int tj;
};
milk milks[110];
bool cmp(milk a,milk b)
{
if(a.jg!=b.jg)
return a.jg<b.jg;
else
return a.tj>b.tj;
}
int main()
{
int t,n;
int i,j,k,l,dj;
double sum;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",milks[i].pp);
scanf("%d%d",&dj,&milks[i].tj);
j=milks[i].tj;
for(k=1;;k++)
{
j-=200;
/* for(1;2;3)
4;
运行顺序:1-->2-->4-->3-->2 */
}
if(j<200)
break;
if(k==5)
break;
}
sum=0;
if(milks[i].tj<200)
sum=-1;
else
sum=dj/(k*1.0);
milks[i].jg=sum;
}
sort(milks,milks+n,cmp);
for(i=0;;i++)
if(milks[i].jg>0)
break;
printf("%s\n",milks[i].pp);
}
return 0;
}