1083. List Grades (25)

1.题目提到各个同学的分数是唯一的，所以可以采用分数作为下标，直接建立101个学生节点，即0~100分

2.然后根据最高分限制和最低分限制，筛选出学生进行输出

//#include<string>
//#include <iomanip>
//#include<stack>
//#include<unordered_set>
//#include <sstream>
//#include "func.h"
//#include <list>
#include<unordered_map>
#include<set>
#include<queue>
#include<map>
#include<vector>
#include <algorithm>
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory.h>
#include<limits.h>
#include<stack>
using namespace std;
struct StudentNode{
	string id, name;
	StudentNode() :id(""), name(""){};
};
int main(void)
{
	vector<StudentNode> student(101);
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		int grade;
		string name, id;
		cin >> name >> id >> grade;
		student[grade].name = name;
		student[grade].id = id;
	}
	int minGrade , maxGrade;
	cin >> minGrade >> maxGrade;
	vector<StudentNode> ans(0);
	for (int i = maxGrade; i >= minGrade; i--)
	{
		if (student[i].name!="")
		{
			ans.push_back(student[i]);
		}
	}

	if (ans.size() == 0)
		cout << "NONE" << endl;
	else
	{
		for (int i = 0; i < ans.size(); i++)
			cout << ans[i].name << " " << ans[i].id << endl;
	}

	return 0;
}