#include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
struct node{
string num;
int seat;
}Node[1010];
int main(){
int n, m, a, b, c;
scanf("%d", &n);
string str;
while(n--){
cin>>str>>a>>b;
Node[a].num = str;
Node[a].seat = b;
}
scanf("%d", &m);
while(m--){
scanf("%d", &c);
cout<<Node[c].num<<" "<<Node[c].seat<<endl;
}
return 0;
}
第一次,独立完成
long long可表示18位数字
解二,参考算法笔记
struct student{
long long zkz;
int ks;
}stu[1000];
#include<stdio.h>
int main(){
int n,m;
scanf("%d",&n);
long long id;
int seat,examseat;
for(int i=0;i<n;i++){
scanf("%lld %d %d",&id,&seat,&examseat);
stu[seat].zkz=id;
stu[seat].ks=examseat;
}
scanf("%d",&m);
for(int i=0;i<m;i++){
scanf("%d",&seat);
printf("%lld %d\n",stu[seat].zkz,stu[seat].ks);
}
}