望不到头

#include<iostream>
using namespace std; struct node{ string name; int idx; string jnum; string dnum; }a[100001]; int main(){ int n,m; cin>>n; int t,t1; string t2; for(int i=1;i<=n*3;i++){cin>>t>>t1>>t2; a[t].idx=t; switch(t1){ case 2: a[t].name=t2;break; case 3: a[t].jnum=t2;break; case 4: a[t].dnum=t2;break; } } for(int i=1;i<=n;i++){ cout<<a[i].idx<<' '<<a[i].name<<' '<<a[i].jnum<<' '<<a[i].dnum<<endl; } return 0; }