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 gradeF-gradeM. 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:
3
Joe M Math990112 89
Mike M CS991301 100
Mary F EE990830 95
Sample Output 1:
Mary EE990830
Joe Math990112
6
Sample Input 2:
1
Jean M AA980920 60
Sample Output 2:
Absent
Jean AA980920
NA
解题思路:排序题,可以将男女生分开处理,我们在遍历的时候,可以直接得到最高分数分女生和最低分数的男生,不必再特地排序。
#include <iostream>
#include <cstring>
using namespace std;
int main(){
char nameboy[15], namegirl[15], nametemp[15], idboy[15], idgirl[15], idtemp[15], flag;
int scoreboy = 101, scoregirl = -1, score, n;
scanf("%d", &n);
for(int i = 0; i < n; ++ i){
scanf("%s %c %s %d", nametemp, &flag, idtemp, &score);
if(flag == 'F' && score > scoregirl){
scoregirl = score;
strcpy(namegirl, nametemp);
strcpy(idgirl, idtemp);
}
else if(flag == 'M' && score < scoreboy){
scoreboy = score;
strcpy(nameboy, nametemp);
strcpy(idboy, idtemp);
}
}
if(scoregirl == -1)
printf("Absent\n");
else
printf("%s %s\n", namegirl, idgirl);
if(scoreboy == 101)
printf("Absent\n");
else
printf("%s %s\n", nameboy, idboy);
printf("%s", (scoreboy == 101 || scoregirl == -1) ? "NA" : to_string(scoregirl - scoreboy).c_str());
}