题解

#include<bits/stdc++.h>
using namespace std;

struct peo
{
	int id,times;
    string id2,id3;
};
bool cmp(peo x,peo y)
{
    return x.id<y.id;
}
int main()
{
    int n,m;
    cin >> n >> m;
    peo a[n];
    for (int i=0;i<n;i++)
    {
        cin >> a[i].id >> a[i].id2 >> a[i].id3;
        a[i].times=0;
    }
    sort(a,a+n,cmp);
    for (int i=0;i<m;i++)
    {
        int id,cl;
        cin >> id >> cl;
        if (cl>9) a[id-1].times++;
    }
    for (int i=0;i<n;i++)
        cout << a[i].id << ' ' << a[i].id2 << ' ' << a[i].id3 << ' ' << a[i].times << endl;
    return 0;
}