题解

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int n,m,x,y;
struct awa
{
    int id,num;
    string a,b;
}k[15];
bool cmp(awa x,awa y)
{
    return x.id<y.id;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>k[i].id>>k[i].a>>k[i].b;
    }
    sort(k+1,k+1+n,cmp);
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        if(y>9)
        {
            k[x].num++;
        }
    }
    for(int i=1;i<=n;i++)
    {
        cout<<k[i].id<<" "<<k[i].a<<" "<<k[i].b<<" "<<k[i].num<<endl;
    }
}