7-34 通讯录的录入与显示 (10 分)

注意

1. 给出的查询有负数

#include <iostream>
#include <string>
#include <vector>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <unordered_map>
const int N = 12; 
using namespace std;
struct info{
	string name, birth, phone, sex, fix;
}E[N];
int main(){
	int n, k, id;
	cin>>n;
	for(int i =0; i < n; i++){
		cin>>E[i].name>>E[i].birth>>E[i].sex>>E[i].fix>>E[i].phone;
	}
	cin>>k;
	while(k--){
		cin>>id;
		if(id < 0 || id >= n) cout<<"Not Found"<<endl;
		else{
			cout<<E[id].name<<" "<<E[id].fix<<" "<<E[id].phone<<" "<<E[id].sex<<" "<<E[id].birth<<endl; 
		}
	}
	return 0;
}