#include <cstdio>
#include <algorithm>
using namespace std;
typedef struct node
{
char id [15];
char name [15];
int score;
}record;
bool cmp(record a,record b)
{
return a.score > b.score;
}
int main()
{
int n,g1,g2;
int flag =0;
record r[1000];
scanf("%d",&n);
for(int i = 0;i<n;i++)
{
scanf("%s %s %d",r[i].name,r[i].id,&r[i].score);
}
scanf("%d %d",&g1,&g2);
sort(r,r+n,cmp);
for(int i = 0;i<n;i++)
{
if(r[i].score <= g2 && r[i].score >= g1)
{
printf("%s %s\n",r[i].name,r[i].id);
flag = 1;
}
}
if(flag == 0)
{
printf("NONE");
}
}
在这里插入代码片
水题不说了