【PAT】L2-009. 抢红包【C++快排】

#include<bits/stdc++.h>
using namespace std;

struct infor{
	double book;
	int id;
}S[100005];

int cmp(infor a,infor b){
	
	if(a.book!=b.book)
		return a.book > b.book;
	if(a.id!=b.id)
		return a.id<b.id;
} 

int main(){	
		int n,i,j,k,t;
		scanf("%d",&n);
				
		int nnum,psum;
		
		for(i = 0 ; i<= n ;i++){
		S[i].book = 0;
		S[i].id = i;
		}		
					
		for(i=1;i<=n;i++){
								
			scanf("%d",&t);
			double sum = 0;	
						
			for(j=1;j<=t;j++){				
					scanf("%d %d",&nnum,&psum);
					S[nnum].book+=psum/100.0;
				sum+=psum;	
				}
				S[i].book-=sum/100.0;					
			}
			
		sort(S+1,S+n+1,cmp);	
			
		for(i=1;i<=n;i++)
				printf("%d %.2lf\n",S[i].id,S[i].book);
				
	return 0;
}