repeat_ L2-009 red envelope grabbing_ sort

 

// L2-009  Grab a red envelope 
#include<bits/stdc++.h>
using namespace std;

// n<=1e4
const int N=2e4+5;
const int ID=1e4+5;

typedef struct people{ int id,cnt,sum; }P; P a[N];

bool cmp( P x,P y )
{
    if( x.sum==y.sum )
    {
        return ( x.cnt==y.cnt ) ? ( x.id<y.id ) : ( x.cnt>y.cnt );
    }
    else return ( x.sum>y.sum ) ;
}

void init( int n )
{
    for( int i=1;i<=n;i++ ) a[i].cnt=a[i].sum=0;
}

int main()
{
    int n,k,i,id,cost; 
    for( i=1;i<ID;i++ ) a[i].id=i;      // ID

    while( ~scanf("%d",&n) )
    {
        init(n);

        for( i=1;i<=n;i++ )          //  Use... In the back  n  Not available here  while
        {
            scanf("%d",&k);         //  The first i The line is numbered as i A record of people giving red envelopes  //  The topic should be studied clearly ! debug  It takes too much time 
            while( k-- )
            {
                scanf("%d%d",&id,&cost);
                a[i].sum-=cost;
                a[id].cnt++; 
                a[id].sum+=cost; 
            }
        }
        sort( a+1,a+n+1,cmp );

        for( i=1;i<=n;i++ ) printf("%d %.2lf\n",a[i].id, (double) a[i].sum / 100 );
    }
    return 0;
}
// （ In units ） （ In yuan , Output after decimal point 2 position ）  Non negligible parentheses