答案

#include <bits/stdc++.h>
using namespace std;
int n, m;
struct stu{
	int id, cnt = 0;
	string l, r;
}a[20];
bool cmp(stu x, stu y){
	return x.id < y.id;
}
int main(){
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> a[i].id >> a[i].l >> a[i].r;
	}
	sort(a + 1, a + n + 1, cmp);
	for(int i = 1; i <= m; i++){
		int x, y;
		cin >> x >> y;
		if(y > 9) a[x].cnt++;
	}
	for(int i = 1; i <= n; i++){
		cout << a[i].id << " " << a[i].l << " " << a[i].r << " " << a[i].cnt << endl;
	}
	return 0;
}