#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int maxn = 100 + 10;typedef struct Milk{    int yuan;    int value;    char name[maxn];    double weight; //保存代价}Milk;Milk a[maxn]; //结构体数组存放void solve(int n){    int p, j;    double min = 999999; //精度要注意    for(int i = 0; i < n; i++){        if(a[i].value < 200) continue;        if(a[i].value >= 1000) p = 5;        else p = a[i].value/200;        a[i].weight = double(a[i].yuan/p); //注意类型转换        if(a[i].weight < min){            min = a[i].weight;            j = i;        }        else if(a[i].weight == min){            if(a[i].value > a[j].value){                j = i;            }        }    }    printf("%s\n", a[j].name);}int main(){    int t, n;    while(~scanf("%d", &t)){        while(t--){            memset(a, 0, sizeof(a));            scanf("%d", &n);            for(int i = 0; i < n; i++)                scanf("%s%d%d", a[i].name, &a[i].yuan, &a[i].value);            solve(n);        }    }    return 0;}