PAT (Advanced Level) Practise 1036

最新推荐文章于 2018-02-08 12:41:58 发布

SpiderOG

最新推荐文章于 2018-02-08 12:41:58 发布

阅读量264

点赞数

分类专栏： PAT A 文章标签： pat-A

本文链接：https://blog.csdn.net/SpiderOG/article/details/73440998

版权

PAT A 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

PAT (Advanced Level) Practise 1036

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 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 <stdio.h>
#include <string.h>

typedef struct {
    char name[12];
    char gender;
    char course[12];
    int grade;
} Student;

void copy_record(Student *s1, Student *s2) 
{
    strcpy(s1->name, s2->name);
    strcpy(s1->course, s2->course);
    s1->gender = s2->gender;
    s1->grade = s2->grade;
}

int main(void)
{
    Student highest_female, lowest_male, input;
    int has_lowest_male = 0, has_highest_female = 0;
    int n;

    scanf("%d", &n);
    while ( n-- ) {
        scanf("%s %c %s %d", input.name, 
            &input.gender, input.course, 
            &input.grade);
        if ( (!has_highest_female && input.gender == 'F') || 
            (has_highest_female && input.gender == 'F' && 
                 input.grade > highest_female.grade) ) {
            copy_record(&highest_female, &input);
            has_highest_female = 1;
        }
        else if ( (!has_lowest_male && input.gender == 'M') ||
            (has_lowest_male && input.gender == 'M' &&
                input.grade < lowest_male.grade) )  {   
            copy_record(&lowest_male, &input);
            has_lowest_male = 1;
        }
    }
    if ( has_highest_female && has_lowest_male ) {
        printf("%s %s\n", highest_female.name, highest_female.course);
        printf("%s %s\n", lowest_male.name, lowest_male.course);
        printf("%d\n", highest_female.grade - lowest_male.grade);
    } else if ( has_highest_female ) {
        printf("%s %s\n", highest_female.name, highest_female.course);
        printf("Absent\n");
        printf("NA\n");
    } else {
        printf("Absent\n");
        printf("%s %s\n", lowest_male.name, lowest_male.course);
        printf("NA\n");
    }
    return 0;
}