5行！！！

简单！！！

#include<bits/stdc++.h>
using namespace std;
struct emp { int id; string st; string nu; int sum; } arr[15];
bool cmp(emp x, emp y) { return x.id < y.id;}
int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> arr[i].id >> arr[i].st >> arr[i].nu; arr[i].sum = 0;} for (int i = 0; i < m; i++) { int x, t;   cin >> x >> t; if (t > 9) { for (int j = 1; j <= n; j++) { if (arr[j].id == x) { arr[j].sum++; break; } } } } sort(arr + 1, arr + n + 1, cmp);for (int i = 1; i <= n; i++) { cout << arr[i].id << " " << arr[i].st << " " << arr[i].nu << " " << arr[i].sum << endl; }    }

https://www.acgo.cn/application/1955587765123280896求进团！！！