Day55: [PAT甲级] 1036 Boys vs Girls (25分)

Day55: [PAT甲级] 1036 Boys vs Girls (25分)

题源:

来自PAT真题库:

https://pintia.cn/problem-sets/994805342720868352/problems/994805453203030016

代码:

dirty code凑合看吧

#include<iostream>
#include<string>
#include<sstream>
#include<vector>
#include<map>
#include<unordered_map>
#include<queue>
#include<set>
#include<unordered_set>
#include<cstdio>
#include<algorithm>
using namespace std;
int N;
typedef struct stu {
	string name;
	string gender;
	string id;
	int grade;
}stu;
int main() {
	cin >> N;
	stu low = {"null","null","null",101};
	stu high= { "null","null","null",-1 };
	stu X;
	for (int i = 0; i < N; i++) {
		cin >> X.name >> X.gender >> X.id >> X.grade;
		if (X.gender == "M") {
			if (low.grade > X.grade) low = X;
		}
		else {
			if (high.grade < X.grade) high = X;
		}
	}
	bool flag=false;
	if (high.grade == -1) {
		flag = true;
		cout << "Absent" << endl;
	}
	else {
		cout << high.name << " " << high.id << endl;
	}
	if (low.grade == 101) {
		flag = true;
		cout << "Absent" << endl;
	}
	else {
		cout << low.name << " " << low.id << endl;
	}
	if (flag == true) cout << "NA";
	else cout << high.grade - low.grade;
	system("pause");
}
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值