PAT (Advanced) 1083. List Grades (25)

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

using namespace std;

struct Student
{
	string name;
	string id;
	int grade;
};

bool cmp(const Student &a, const Student &b)
{
	if (a.grade != b.grade)
		return a.grade > b.grade;
}

int main()
{
	int n;
	cin >> n;
	vector<Student> student;
	vector<Student> result;

	for (int i = 0; i < n; i++)
	{
		Student stu;
		cin >> stu.name >> stu.id >> stu.grade;
		student.push_back(stu);
	}
	int grade1, grade2;
	cin >> grade1 >> grade2;
	
	for (auto it = student.begin(); it != student.end(); ++it)
	{
		if (it->grade >= grade1 && it->grade <= grade2)
			result.push_back(*it);
	}
	sort(result.begin(), result.end(), cmp);
	if (result.empty())
		cout << "NONE" << endl;
	else
	{
		for (auto it = result.begin(); it != result.end(); ++it)
		{
			cout << it->name << " " << it->id << endl;
		}
	}
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值