#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn=1e4+5;
struct node{
int no,cnt,money;
}N[maxn];
bool cmp(node a,node b){
if (a.money != b.money)
return a.money > b.money;
else if(a.cnt != b.cnt)
return a.cnt > b.cnt;
else return a.no < b.no;
}
int main(){
int n,k,no,sum,money;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&k);
sum = 0;
for(int j=0;j<k;j++){
scanf("%d%d",&no,&money);
sum += money;
N[no-1].money += money;
N[no-1].cnt+=1;
}
N[i].no = i;
N[i].money -= sum;
}
sort(N,N+n,cmp);
for(int i=0;i<n;i++){
printf("%d %.2f\n",N[i].no+1,N[i].money*1.0/100);
}
return 0;
}
L2-009 抢红包 (25 分)
最新推荐文章于 2022-04-20 23:56:01 发布