哈理工A大吉大利-吃鸡

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1050;
typedef struct node{
    int p,k;
    int kk[maxn];
}Gay;
Gay gay[maxn];
double qq[maxn];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        memset(qq,0,sizeof(qq));
        double ans = -1;
        for(int i=1;i<=n;i++) {
            scanf("%d%d",&gay[i].p,&gay[i].k);
            for(int j=1;j<=gay[i].k;j++) scanf("%d",&gay[i].kk[j]);
        }
        double x;
        int pos;
        for(int i=1;i<=m;i++) {
            scanf("%d%lf",&pos,&x);
            qq[pos] = max(qq[pos],x);
        }
        for(int i=1;i<=n;i++)
        {
            double temp = 0;
            for(int j=1;j<=gay[i].k;j++) temp += qq[gay[i].kk[j]];
            temp = gay[i].p * (temp + 1);
            ans = max(temp,ans);
        }
        printf("%.4f\n",ans);
    }
    return 0;
}