A1036 Boys vs Girls

最新推荐文章于 2022-03-01 15:09:00 发布

子生

最新推荐文章于 2022-03-01 15:09:00 发布

阅读量160

点赞数

分类专栏： PTA

本文链接：https://blog.csdn.net/qq_41667538/article/details/88554462

版权

PTA 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

本篇博客介绍了一种算法，用于分析学生数据集中的性别与成绩之间的关系。算法接收包含学生姓名、性别、ID和成绩的数据输入，计算并输出最高分女性学生与最低分男性学生的成绩差值。该算法能有效处理缺失数据情况，并提供清晰的输出格式。

摘要由CSDN通过智能技术生成

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 Nlines 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<cstdio>

struct student
{
	char name[15];
	char gender;
	char id[15];
	int grade;
}highest, lowest, temp;

void init()
{
	highest.grade = 0;
	lowest.grade = 100;
}

int main(void)
{
	init();
	int n, f = 0, m = 0;
	scanf("%d", &n);
	for(int i = 0; i < n; i++)
	{
		scanf("%s", temp.name);
		getchar();
		scanf("%c", &temp.gender);
		scanf("%s %d", temp.id, &temp.grade);
		if(temp.gender == 'F')
		{
			f++;
			if(temp.grade > highest.grade)
			{
				highest = temp;
			}
		}
		else
		{
			m++;
			if(temp.grade < lowest.grade)
			{
				lowest = temp;
			}
		}
	}
	if(f == 0)
	{
		printf("Absent\n");
		printf("%s %s\n", lowest.name, lowest.id);
		printf("NA");
	}
	else if(m == 0)
	{
		printf("%s %s\n", highest.name, highest.id);
		printf("Absent\n");
		printf("NA");
	}
	else
	{
		printf("%s %s\n", highest.name, highest.id);
		printf("%s %s\n", lowest.name, lowest.id);
		printf("%d", highest.grade - lowest.grade);
	}
	return 0;
}