View Code of Problem 3861

#include<iostream>
#include<cstring>
#include<math.h>
#include<algorithm>
using namespace std;
struct node{
	char name[50];
	int p;
	int q;
};
bool cmp(node a,node b)
{
	double i=(double)a.p/a.q;
	double j=(double)b.p/b.q;
	return i>j;
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--) {
		int n;
		scanf("%d",&n);
		node mobile[1000];
		for(int i=0;i<n;i++){
			scanf("%s",mobile[i].name);
			scanf("%d %d",&mobile[i].p,&mobile[i].q);
		}
		sort(mobile,mobile+n,cmp);
		for(int i=0;i<n;i++){
			printf("%d %s %d %d\n",i+1,mobile[i].name,mobile[i].p,mobile[i].q);	
		}
	}
	return 0;
}