View Code of Problem 3861

#include<iostream>
#include<algorithm>
using namespace std;

struct node{
	string n;
	double p;
	double q;
	double bi;
}s[105];
bool cmp(node x,node y){
	return x.bi>y.bi;
}
int main() {
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		for(int i=0;i<n;i++){
			cin>>s[i].n>>s[i].p>>s[i].q;
			s[i].bi=s[i].p/s[i].q;
		}
		sort(s,s+n,cmp);
		for(int i=0;i<n;i++){
			cout<<i+1<<" "<<s[i].n<<" "<<s[i].p<<" "
			<<s[i].q<<endl;
		} 
		
	}
    return 0;
}