水题
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1000010;
struct node
{
string name;
string id;
int grade;
}Node[MAXN];
bool cmp(node a,node b)
{
return a.grade > b.grade;
}
vector<node> v;
int main(void)
{
freopen("pat0314/in.txt","r",stdin);
int n;
cin>>n;
for(int i = 0;i<n;i++)
{
cin>>Node[i].name>>Node[i].id>>Node[i].grade;
}
int beginGrade,endGrade;
cin>>beginGrade>>endGrade;
for(int i = 0;i<n;i++)
{
if(Node[i].grade >= beginGrade && Node[i].grade <= endGrade)
{
v.push_back(Node[i]);
}
}
if(v.size() == 0)
{
printf("NONE");
return 0;
}
sort(v.begin(),v.end(),cmp);
for(int i = 0;i<v.size();i++)
{
cout<<v[i].name<<" "<<v[i].id<<endl;
}
return 0;
}