PAT 1083. List Grades (25)

1083. List Grades (25)

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

Sample Input 2:

2
Jean AA980920 60
Ann CS01 80
90 95

Sample Output 2:

NONE
 1 #include <iostream>
 2 #include <vector>
 3 #include <string>
 4 #include <algorithm>
 5
 6 using namespace std;
 7
 8 struct Student
 9 {
10     string name;
11     string id;
12     int grade;
13 };
14
15 bool cmp(const Student& s1, const Student& s2)
16 {
17     return s1.grade > s2.grade;
18 }
19
20 vector<Student> students(101);
21
22 int main()
23 {
24     int stuNum;
25     cin >> stuNum;
26
27     for (int i = 0; i < stuNum; i++)
28         cin >> students[i].name >> students[i].id >> students[i].grade;
29     sort(students.begin(), students.end(), cmp);
30     int grade1, grade2;
31     cin >> grade1 >> grade2;
32     bool flag = false;
33     for (int i = 0; i < students.size(); i++)
34     {
35         if (students[i].grade >= grade1&&students[i].grade <= grade2)
36         {
37             cout << students[i].name << " " << students[i].id << endl;
38             flag = true;
39         }
40         if (students[i].grade < grade1)
41             break;
42     }
43     if (!flag)
44         cout << "NONE";
45
46 }
时间: 2024-10-29 19:08:10

PAT 1083. List Grades (25)的相关文章

1083. List Grades (25)【水题】——PAT (Advanced Level) Practise

题目信息 1083. List Grades (25) 时间限制400 ms 内存限制65536 kB 代码长度限制16000 B 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 w

1083. List Grades (25)

1083. List Grades (25) 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. In

PAT(A) 1083. List Grades (25)

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

PAT (Advanced Level) 1083. List Grades (25)

简单排序. #include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<map> #include<stack> #include<queue> #include<string> #include<iostream> #include<algorithm> using namespace std

PAT:1083. List Grades (25) AC

#include<stdio.h> #include<algorithm> using namespace std; struct Student { char name[15]; char ID[15]; int gread; }STU[66666]; bool cmp(Student a,Student b) { return a.gread>b.gread; } int main() { int n; scanf("%d",&n); for(

PAT 1083 List Grades

#include <cstdio> #include <cstdlib> using namespace std; class Stu { public: char name[12]; char id[12]; }; int main() { int N = 0; // because all the grades are distinct & grade in range of [0, 100] // use simplified bucket sort here Stu

1083. List Grades (25)-简单的排序

给定区间[L,R],给出在这区间之内的学生,并且按照他们的成绩非升序的顺序输出. #include <iostream> #include <cstdio> #include <string.h> #include <algorithm> using namespace std; const int maxn=10005; struct Stu{ char name[15]; char id[15]; int grade; bool operator<

pat1083. List Grades (25)

1083. List Grades (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue 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 t

1083. List Grades

1083. List Grades (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue 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 t