结构体排序

#include<bits/stdc++.h>
using namespace std;
struct stu{
    string num,clas;
    int time,id;
}a[10001];
bool cmp(stu a,stu b){
    return a.id<b.id;
}
int main(){
    int n,m;cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i].id>>a[i].num>>a[i].clas;
        a[i].time=0;
    }sort(a+1,a+n+1,cmp);
    for(int i=1;i<=m;i++){
        int cdk,hour;
        cin>>cdk>>hour;
        if(hour>9) a[cdk].time++;
    }
    
    for(int i=1;i<=n;i++){
        cout<<a[i].id<<" "<<a[i].num<<" "<<a[i].clas<<" "<<a[i].time<<endl;
    }
    return 0;
}