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 100Sample Output 1:
Mike CS991301 Mary EE990830 Joe Math990112Sample Input 2:
2 Jean AA980920 60 Ann CS01 80 90 95Sample Output 2:
NONE
就是一个简单排序和范围比较,直接用STL的sort即可,不多说,上代码;
如下:
/************************************
This is a test program for anything
Enjoy IT!
************************************/
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <list>
#include <set>
#include <fstream>
#include <string>
#include <cmath>
using namespace std;
struct Student
{
string name;
string ID;
int grade;
Student(string name, string ID, int grade)
: name(name), ID(ID), grade(grade){}
};
bool UPcomp(const Student &l, const Student &r)
{
return l.grade > r.grade;
}
int main()
{
/*ifstream cin;
cin.open("in.txt");
ofstream cout;
cout.open("out.txt");*/
//
// TO DO Whatever You WANT!
int n;
while (cin >> n)
{
vector<Student> sList;
for (int i = 0; i < n; i++)
{
string name, id;
int grade;
cin >> name >> id >> grade;
Student st(name, id, grade);
sList.push_back(st);
}
int down, up;
cin >> down >> up;
bool flag = false;
sort(sList.begin(), sList.end(), UPcomp);
for (vector<Student>::const_iterator it = sList.begin(); it != sList.end(); it++)
{
if (it->grade > up) continue;
if (it->grade < down) break;
flag = true;
cout << it->name << " " << it->ID << endl;
}
if (!flag) cout << "NONE" << endl;
}
//
// system("pause");
return 0;
}