PAT 甲级 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.

输入

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.

输出

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.

思路

挺简单的,就是找最大最小值问题

代码

#include<iostream>
#include<string>
#include<stdlib.h>
#include<cstdio>
#include<vector>
using namespace std;
typedef struct node {
	string name;
	string gendar;
	string id;
	int grade;
}Stu;
Stu stus[100000];
int mmin = 101;
int mmax = 0;
int main()
{
	int N;
	cin >> N;
	int M=-1, W=-1;
	for (int i = 0; i < N; i++)
	{
		cin >> stus[i].name >> stus[i].gendar >> stus[i].id >> stus[i].grade;
		if (stus[i].gendar[0] == 'M')
		{
			if (stus[i].grade < mmin)
			{
				mmin = stus[i].grade;
				M = i;
			}
		}
		else
		{
			if (stus[i].grade > mmax)
			{
				mmax = stus[i].grade;
				W = i;
			}
		}
	}
	if (W == -1)
	{
		cout << "Absent" << endl;
	}
	else
	{
		cout << stus[W].name << " " << stus[W].id << endl;
	}
	if (M == -1)
	{
		cout << "Absent" << endl;
	}
	else
	{
		cout << stus[M].name << " " << stus[M].id << endl;
	}
	if (M != -1 && W != -1)
	{
		cout << mmax - mmin << endl;
	}
	else
	{
		cout << "NA" << endl;
	}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值