抢红包

题目:
​​​题目链接:​​

题解:
模拟

#include <bits/stdc++.h>
using namespace std;
struct node {
  int x;
  long long ans=0;
  int s=0;
};
struct node p[10005];
bool cmp(node a,node b)
{
  if(a.ans==b.ans) return a.s>b.s;
  else return a.ans>b.ans;
}
int main()
{
  int n;
  cin>>n;
  for(int i=1;i<=n;i++)
  {
    int k;
    scanf("%d",&k);
    p[i].x=i;
    while(k--)
    {
      int a,b;
      scanf("%d %d",&a,&b);
      p[a].ans+=b;
      p[a].s++;
      p[i].ans-=b;
    }
  }
  sort(p+1,p+n+1,cmp);
  for(int i=1;i<=n;i++)
  {
    cout<<p[i].x<<" ";
    double s=p[i].ans/100.0;
    printf("%.2f\n",s);
  }
  return 0;
}