L2-009 抢红包 (25 分)

原题链接

#include<bits/stdc++.h>
using namespace  std;
struct node{
    double shou,fa;
    int geshu;
    double shouru;
    int num;
}p[11111];
bool cmp(node a,node b)
{
    return tie(a.shouru,a.geshu,b.num)>tie(b.shouru,b.geshu,a.num);
}
int b,t;//b每个人编号 t金额
int main()
{
    int n,k;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>k;
        for(int j=0;j<k;j++)
        {
            cin>>b;
            cin>>t;
            p[i].fa+=t;
            p[b].shou+=t;
            p[b].geshu++;
        }
        p[i].num=i;
    }
    
    for(int i=1;i<=n;i++)
    {
        p[i].shouru=p[i].shou-p[i].fa;
    }
    sort(p+1,p+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        printf("%d %.2f\n",p[i].num,1.0*p[i].shouru/100);
    }
}