思路比较清晰的代码

#include<bits/stdc++.h>
using namespace std;
struct node{
    int id;
    string name,dnum,jnum;
};
struct Node{
    int id1,num;
    string s;
};
Node a[63];
node b[21];
bool cmp(node x,node y){
    return x.id<y.id;
}
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n*3;i++){
	    cin>>a[i].id1>>a[i].num>>a[i].s;
	    b[a[i].id1].id=a[i].id1;
	    if(a[i].num==2) b[a[i].id1].name=a[i].s;
	    if(a[i].num==3) b[a[i].id1].dnum=a[i].s;
	    if(a[i].num==4) b[a[i].id1].jnum=a[i].s;
}
    sort(b+1,b+1+n,cmp);
    for(int i=1;i<=n;i++){
	    cout<<b[i].id<<" "<<b[i].name<<" "<<b[i].dnum<<" "<<b[i].jnum<<endl;
}
    return 0;
}