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]
andID[i]
are strings of no more than 10 characters with no space,grade[i]
is an integer in [0, 100],grade1
andgrade2
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, outputNONE
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
作者: CHEN, Yue
单位: 浙江大学
时间限制: 400 ms
内存限制: 64 MB
代码长度限制: 16 KB
这个排序题的25分跟我刚刚前面写的那道完全不是一个难度的嘛!这题很水!
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
typedef struct
{
int s;
char nm[15],id[15];
}node;
node a[10005];
bool cmp(node x,node y)
{
return x.s > y.s;
}
int main()
{
int n,flag = 0;
cin>>n;
for(int i = 0 ; i < n;i++)
{
cin>>a[i].nm>>a[i].id>>a[i].s;
}
sort(a,a + n,cmp);
int le,ri;
cin>>le>>ri;
if(le > ri)
swap(le,ri);
for(int i = 0;i < n;i++)
{
if(a[i].s >= le && a[i].s <= ri)
{
cout<<a[i].nm<<" "<<a[i].id<<endl;
flag = 1;
}
}
if(!flag)
cout<<"NONE"<<endl;
return 0;
}