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
部分AC代码(自己写的):
#include<bits/stdc++.h>
using namespace std;
struct person{
char name[15],id[15];
int grade;
}f[105],m[105];
bool cmp(person &x,person &y){
return x.grade<y.grade;
}
int main(){
int n,countf=0,countm=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
char tname[15],sex,tid[15];
int tgrade;
scanf("%s %c %s %d",tname,&sex,tid,&tgrade);
if(sex=='F'){
strcpy(f[countf].name,tname);
strcpy(f[countf].id,tid);
f[countf++].grade=tgrade;
}
else if(sex=='M'){
strcpy(m[countm].name,tname);
strcpy(m[countm].id,tid);
m[countm++].grade=tgrade;
}
}
if(countf==0)printf("Absent\n");
else{
sort(f,f+(countf-1),cmp);
printf("%s %s\n",f[countf-1].name,f[countf-1].id);
}
if(countm==0)printf("Absent\n");
else{
sort(m,m+(countm-1),cmp);
printf("%s %s\n",m[0].name,m[0].id);
}
if(countf==0||countm==0)printf("NA\n");
else printf("%d",f[countf-1].grade-m[0].grade);
return 0;
}
AC代码(算法笔记):
#include<bits/stdc++.h>
using namespace std;
struct person{
char name[15];
char id[15];
int score;
}M,F,temp;
void init(){
M.score=101;
F.score=-1;
}
int main(){
init();
int n;
char gender;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s %c %s %d",temp.name,&gender,temp.id,&temp.score);
if(gender=='M'&&temp.score<M.score)
M=temp;
else if(gender=='F'&&temp.score>F.score)
F=temp;
}
if(F.score==-1)printf("Absent\n");
else printf("%s %s\n",F.name,F.id);
if(M.score==101)printf("Absent\n");
else printf("%s %s\n",M.name,M.id);
if(F.score==-1||M.score==101)printf("NA\n");
else printf("%d\n",F.score-M.score);
return 0;
}
书上这个比较简单,没有设置结构体排序,边输入边比较。
还不知道我那个哪儿错了呢。。。。。