题解

#include <algorithm>
#include<iostream>
using namespace std;
struct gongren{
    int id;
    string gongid;
    string buid;
    int cishu = 0;
}a[20];
bool cmp(gongren x , gongren y){
    return x.id < y.id;
}
int main(){
    int n , m;
    int s , x;
    cin >> n;
    cin >> m;
    for(int i = 0;i < n;i++){
        cin >> a[i].id;
        cin >> a[i].gongid;
        cin >> a[i].buid;
    }
    for(int i = 1;i <= m;i++){
        cin >> s;
        cin >> x;
        for(int j = 0;j < n;j++){
            if(s == a[j].id){
                if(x > 9)a[j].cishu++;
            }
        }
    }
    sort(a + 0,a + n,cmp);
    for(int i = 0;i < n;i++){
        cout << a[i].id << ' ';
        cout << a[i].gongid << ' ';
        cout << a[i].buid << ' ';
        cout << a[i].cishu << endl;
    }
    return 0;
}