题目
思路
排序水题
代码
#include <iostream>
#include <string>
#include<algorithm>
#include<vector>
using namespace std;
#define nmax 105
#define inf 999999
struct Info
{
string name;
string ID;
int grade;
};
vector<Info> vec;
bool cmp(const Info& a, const Info& b) {
return a.grade > b.grade;
}
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
Info info;
cin >> info.name >> info.ID >> info.grade;
vec.emplace_back(info);
}
int low, high;
cin >> low >> high;
sort(vec.begin(), vec.end(), cmp);
bool mark = false;
for (auto& p : vec) {
if (p.grade < low)
continue;
if (p.grade > high)
break;
mark = true;
cout << p.name << " " << p.ID << endl;
}
if (!mark)
cout << "NONE";
return 0;
}