This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students.

Input Specification:

Each input file contains one test case. Each case contains a positive integer N, followed by N lines of student information. Each line contains a student's name, gender, ID and grade, separated by a space, where name and ID are strings of no more than 10 characters with no space, gender is either F (female) or M (male), and grade is an integer between 0 and 100. It is guaranteed that all the grades are distinct.

Output Specification:

For each test case, output in 3 lines. The first line gives the name and ID of the female student with the highest grade, and the second line gives that of the male student with the lowest grade. The third line gives the difference grade_F-grade_M. If one such kind of student is missing, output "Absent" in the corresponding line, and output "NA" in the third line instead.

Sample Input 1:

3Joe M Math990112 89Mike M CS991301 100Mary F EE990830 95Sample Output 1:
Mary EE990830Joe Math9901126Sample Input 2:
1Jean M AA980920 60Sample Output 2:
AbsentJean AA980920NA
#include <cstdio>#include <algorithm>#define Max 123400using namespace std;struct student{ char name[11]; char gen; char Id[11]; int score;}S[Max];int main(){	int n,m1=101,m2=-1,f1=0,f2=-1,flag=0,d;	scanf("%d",&n);	for(int i=0;i<n;i++)	{		scanf("%s %c %s %d",S[i].name,&S[i].gen,S[i].Id,&S[i].score);		if(S[i].gen=='M')		{			if(S[i].score<m1)			{				m1=S[i].score;				m2=i;			}		}		else if(S[i].gen=='F')		{			if(S[i].score>f1)			{				f1=S[i].score;				f2=i;			}		}	}	if(f2==-1)	{		flag=1;		PRintf("Absent/n");	}	else {		printf("%s %s/n",S[f2].name,S[f2].Id);	}	if(m2==-1)	{		flag=1;		printf("Absent/n");	}	else {		printf("%s %s/n",S[m2].name,S[m2].Id);	}	if(flag==1) printf("NA/n");	else {		d=S[f2].score-S[m2].score;		printf("%d/n",d);	}    system("pause");	return 0;}