L2-009. 抢红包
简单排序!!!!
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e4+7;
struct money{
int i = 0;
int cas = 0;
int mo = 0;
} m[maxn];
bool cmp(struct money a, struct money b){
if(a.mo != b.mo) return a.mo > b.mo;
else if(a.cas != b.cas) return a.cas > b.cas;
else return a.i < b.i;
}
int main()
{
int n;
scanf("%d",&n);
for(int i = 1; i <= n; i++) {
m[i].i = i;
m[i].cas = 0;
m[i].mo = 0;
}
for(int i = 1; i <= n; i++){
int k;
scanf("%d", &k);
int sum = 0;
for(int j = 0; j < k; j++) {
int ni,pi;
scanf("%d%d",&ni, &pi);
m[ni].mo += pi;
m[ni].cas++;
sum += pi;
}
m[i].mo -= sum;
}
sort(m+1, m+n+1, cmp);
for(int i = 1; i <= n; i++) {
printf("%d %.2lf\n", m[i].i, m[i].mo*1.0/100);
}
return 0;
}