1083 List Grades
作者:互联网
1083 List Grades
Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades are in a given interval.
Input Specification:
Each input file contains one test case. Each case is given in the following format:
N
name[1] ID[1] grade[1]
name[2] ID[2] grade[2]
... ...
name[N] ID[N] grade[N]
grade1 grade2
where name[i]
and ID[i]
are strings of no more than 10 characters with no space, grade[i]
is an integer in [0, 100], grade1
and grade2
are the boundaries of the grade’s interval. It is guaranteed that all the grades are distinct.
Output Specification:
For each test case you should output the student records of which the grades are in the given interval [grade1
, grade2
] and are in non-increasing order. Each student record occupies a line with the student’s name and ID, separated by one space. If there is no student’s grade in that interval, output NONE
instead.
Sample Input 1:
4
Tom CS000001 59
Joe Math990112 89
Mike CS991301 100
Mary EE990830 95
60 100
Sample Output 1:
Mike CS991301
Mary EE990830
Joe Math990112
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct student
{
char name[15];
char id[15];
int grade;
}stu[50];
bool cmp(student s1, student s2)
{
return s1.grade > s2.grade;
}
int main()
{
int n;
scanf_s("%d", &n);
for (int i = 0; i < n; i++)
{
scanf_s("%s %s %d", &stu[i].name, sizeof(char) * 15, &stu[i].id, sizeof(char) * 15, &stu[i].grade);
}
sort(stu, stu + n, cmp);
int min, max;
int num = 0;
scanf_s("%d%d", &min, &max);
for (int i = 0; i < n; i++)
{
if (stu[i].grade >= min && stu[i].grade <= max)
{
printf("%s %s\n", stu[i].name, stu[i].id);
num++;
}
}
if (num == 0)
{
printf("NONE\n");
}
}
标签:int,1083,name,grade,List,stu,Grades,student,ID 来源: https://blog.csdn.net/weixin_44230791/article/details/122786714