find student information

#include<stdio.h>
#include<algorithm>
using namespace std;
struct student{
	int id;
	char name[20];
	char gender[5];
	int age;
};
bool cmp(student A,student B){
	return A.id<B.id;
}

int BiSearch(student stu[],int n,int id){
	int left=0,right=n-1,mid;
	while(left<=right){
		mid=(left+right)/2;
		if(id==stu[mid].id) return mid;
		else if(id>stu[mid].id) left=mid+1;
		else right=mid-1;
	}
	return -1;
}


int main(){
	int n;
	student stu[1001];
	scanf("%d",&n);
	for(int i=0;i<n;i++)//20180205,YYYYMMDD，01 李江 男 21 
		scanf("%d%s%s%d",&stu[i].id,stu[i].name,stu[i].gender,&stu[i].age);
	sort(stu,stu+n,cmp);
	int m,key[10001];
	scanf("%d",&m);
	for(int i=0;i<m;i++)
		scanf("%d",&key[i]);
	for(int i=0;i<m;i++){
		int k=BiSearch(stu, n,key[i]);
		if(k!=-1)
		   printf("%02d %s %s %d\n",stu[k].id,stu[k].name,stu[k].gender,stu[k].age); 
		else
	      printf("No Answer!\n") ; 	
	}	    
	return 0;
}
/*
2
01 李江 男 21
02 刘唐 男 23
2 
01
04
*/