我们活在这个世界上,没有一件事是虚空而生的,你站在光里背后就会有阴影,站在黑暗里心中也可能有光明,所以我们必须得承认,有一部分人或许丧失了初心,但也有一部分人用生命来践行诺言。
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
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <sstream>
#include <complex>
#include <iomanip>
#include <numeric>
#include<unordered_set>
#include <climits>//INT_MAX
#define PP pair<ll,int>
#define inf 0x3f3f3f3f
#define llinf 0x3f3f3f3f3f3f3f3fll
#define dinf 1000000000000.0
#define PI 3.1415926
//#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e5+10;
const int maxn=100010;
using namespace std;
int n;
struct node{
int cj;
string id;
string name;
};
bool cmp(node a,node b){
return a.cj>b.cj;
}
int main(){
cin>>n;
vector<node> V(n+1);
for(int i=0;i<n;i++)
{
getchar();
cin>>V[i].name;
getchar();
cin>>V[i].id;
cin>>V[i].cj;
}
int a,b,fg=0;
cin>>a>>b;
sort(V.begin(),V.end(),cmp);
for(int i=0;i<n;i++)
{
if(V[i].cj>=a&&V[i].cj<=b)
{
cout<<V[i].name<<" "<<V[i].id<<"\n";
fg=1;
}
}
if(!fg)
cout<<"NONE\n";
return 0;
}