1036 Boys vs Girls (25)

最新推荐文章于 2023-06-03 11:23:30 发布

ChenyutingZJU

最新推荐文章于 2023-06-03 11:23:30 发布

阅读量492

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/chenyutingdaima/article/details/81978251

版权

PAT甲级专栏收录该内容

54 篇文章

订阅专栏

本文介绍了一种通过编程实现的学生成绩对比方法，该方法能够找出班级中男生最低分与女生最高分之间的差距，并通过结构体数组存储学生信息，利用自定义排序函数进行排序，最后输出特定的成绩对比结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1036 Boys vs Girls (25)
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:

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

解题思路：
1.用结构体数组存储相关信息，用先按性别排序，将女性排在前面，再按分数降序排序，这样数组首位是女性最高，末尾是男性最低。
2.输出时，判断首位和末尾是否是正确的性别，有一个不对，就输出NA。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct Node{
    char name[15],id[15],gender;
    int grade;
}node[110];
bool cmp(Node a,Node b){
    if(a.gender !=b.gender )
        return a.gender <b.gender;
    else 
        return a.grade >b.grade ;
}

int main(){
    int n;
    bool flag=true;
    scanf("%d",&n);
    for(int i=0;i<n;i++) {
        scanf("%s %c %s %d",node[i].name ,&node[i].gender ,node[i].id ,&node[i].grade );
    }
    sort(node,node+n,cmp);
    if(node[0].gender =='F'){
        printf("%s %s\n",node[0].name ,node[0].id );
    }else{
        printf("Absent\n");
        flag=false;
    }
    if(node[n-1].gender =='M'){
        printf("%s %s\n",node[n-1].name ,node[n-1].id );
    }else{
        printf("Absent\n");
        flag=false;
    }
    if(flag==true){
        printf("%d\n",node[0].grade -node[n-1].grade );
    }else{
        printf("NA\n");
    }
    return 0;
}