PAT A 甲级 1036 Boys vs Girls (25分)

最新推荐文章于 2021-08-18 19:29:53 发布

虚境

最新推荐文章于 2021-08-18 19:29:53 发布

阅读量281

点赞数

分类专栏： PAT习题

本文链接：https://blog.csdn.net/qq_39837806/article/details/104134390

版权

PAT习题专栏收录该内容

49 篇文章 0 订阅

订阅专栏

1036 Boys vs Girls (25分)

吐槽

英语不够好又不好好看题的结果就是把Absent错当成了表示“有缺失”的而不是“该行缺失”的。顺带一提这么一说的话测点2（第3个测点）应该是没有男生。

逻辑

用两个vector分别保存男生和女生的数据，然后用两个不同的cmp函数sort然后输出front即可。、

题目

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

代码

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>

using namespace std;

typedef struct
{
	string name;
	string ID;
	int grade;
}stu;

bool cmp1(stu s1, stu s2)
{
	if (s1.grade < s2.grade)
		return true;
	else
		return false;
}

bool cmp2(stu s1, stu s2)
{
	if (s1.grade > s2.grade)
		return true;
	else
		return false;
}

int main()
{
	int m;
	cin >> m;
	int i;
	vector<stu> male;
	vector<stu> female;
	stu temp;
	string temps;
	for (i = 0; i < m; i++)
	{
		cin >> temp.name >> temps >> temp.ID >> temp.grade;
		if (temps == "M")
			male.push_back(temp);
		else if (temps == "F")
			female.push_back(temp);
	}
	sort(male.begin(), male.end(), cmp1);
	sort(female.begin(), female.end(), cmp2);
	if (male.empty() || female.empty())
	{
		if (!male.empty())
			cout << "Absent" << endl << male.front().name << " " << male.front().ID << endl;
		else if (!female.empty())
			cout << female.front().name << " " << female.front().ID << endl << "Absent" << endl;
		cout << "NA";
	}
	else
	{
		cout << female.front().name << " " << female.front().ID << endl;
		cout << male.front().name << " " << male.front().ID << endl;
		cout << female.front().grade - male.front().grade;
	}
	return 0;
}