#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
using namespace std;
struct student
{
char name[12];
char id[12];
int grade;
}stu[200];
bool cmp(student x,student y)
{
return(x.grade>y.grade);
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>stu[i].name>>stu[i].id>>stu[i].grade;
}
sort(stu,stu+n,cmp);
int g1,g2;
cin>>g1>>g2;
bool t=false;
for(int i=0;i<n;i++)
{
if(stu[i].grade>g2){continue;}
if(stu[i].grade<g1){break;}
t=true;cout<<stu[i].name<<" "<<stu[i].id<<endl;
}
if (!t){cout<<"NONE";}
system("pause");
return 0;
#include<string>
#include<string.h>
#include<algorithm>
using namespace std;
struct student
{
char name[12];
char id[12];
int grade;
}stu[200];
bool cmp(student x,student y)
{
return(x.grade>y.grade);
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>stu[i].name>>stu[i].id>>stu[i].grade;
}
sort(stu,stu+n,cmp);
int g1,g2;
cin>>g1>>g2;
bool t=false;
for(int i=0;i<n;i++)
{
if(stu[i].grade>g2){continue;}
if(stu[i].grade<g1){break;}
t=true;cout<<stu[i].name<<" "<<stu[i].id<<endl;
}
if (!t){cout<<"NONE";}
system("pause");
return 0;
}
1.N的范围没有给出,但是根据分数的唯一性可以知道最多也就100