题解，求关注

#include<bits/stdc++.h>
using namespace std;
string mingzi[10001],li;
int qian[10001],n,m,p;
int dfs(string a) 
{
    for(int i=1;i<=n;i++)
    {
        if(a==mingzi[i]) 
		return i;
    }
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    cin>>mingzi[i];
    for(int j=1;j<=n;j++)
    {
        cin>>li;
        cin>>m>>p;
        if(p==0) 
		continue;             
        qian[dfs(li)]+=m%p-m;
        m-=m%p;
        for(int k=1;k<=p;k++)
        {
        	string c;
            cin>>c;
            qian[dfs(c)]+=m/p;
        }
    }
    for(int i=1;i<=n;i++)
    cout<<mingzi[i]<<" "<<qian[i]<<endl;
}