#include<cstdio> #include<cstdlib> #include<cmath> #include<iostream> #include<algorithm> #include<cstring> using namespace std; typedef long long ll; struct node{ char a[100]; int b,c; }s[200]; int cmp(node u,node v){ return u.b/u.c>v.b/v.c; } int main(){ int t,n,i,j,k; scanf("%d",&t); while(t--){ scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s%d%d",s[i].a,&s[i].b,&s[i].c); } sort(s,s+n,cmp); for(i=0;i<n;i++){ printf("%d %s %d %d\n",i+1,s[i].a,s[i].b,s[i].c); } } return 0; } |
Double click to view unformatted code.