PTA L2-010 排座位 (25 分)

#include<iostream>
#include<cstdio>
#include<algorithm>
#define wIN(x,y) for(int w=x;w<y;w++)
using namespace std;
const double eps= 0.000001;
int amount[10005];
double income[10005];
int order[10005];
int f_sort(int x,int y){
	if(income[x]>income[y]+eps)return 1;
	if(income[x]+eps<income[y])return 0;
	if(amount[x]>amount[y])return 1;
	if(amount[x]<amount[y])return 0;
	if(x<y)return 1;
	return 0;
}
int main(){
	int N;
	int parts;
	int who;
	double money;
	cin>>N;
	wIN(1,N+1){ //w行 
		cin>>parts;
		while(parts--){
			cin>>who>>money;
			amount[who]++;   
			income[who]+=money*0.01;
			income[w]-=money*0.01; 
		}
	} //输入完成 
	wIN(0,10005){
		order[w]=w;
	}
	sort(order+1,order+N+1,f_sort);
	wIN(1,N+1){
		printf("%d %.2f\n",order[w],income[order[w]]);
	}
	return 0;
}