List Grades (25)​​​​​​​

List Grades (25)

时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)

题目描述

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.

 

输入描述:

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.

 

输出描述:

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.

 

输入例子:

4
Tom CS000001 59
Joe Math990112 89
Mike CS991301 100
Mary EE990830 95
60 100

 

输出例子:

Mike CS991301
Mary EE990830
Joe Math990112

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;

struct student{
	char name[10];
	int grade;
	char id[10];
}s[105];

bool cmp(struct student x,struct student y)
{
	return x.grade>y.grade;
}
int main()
{
	int n,i,a,b;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		cin>>s[i].name>>s[i].id>>s[i].grade;
	}
	scanf("%d%d",&a,&b);
	int cnt=0;
	sort(s,s+n,cmp);
	for(i=0;i<n;i++)
	{
		if(s[i].grade>=a&&s[i].grade<=b)
		{
			cout<<s[i].name<<' '<<s[i].id<<endl;
		    cnt++;
		}   
	}
	if(cnt==0)
	  cout<<"NONE";
	return 0;
}

非常简单，就是很长时间不用结构体了，快不会用了，暴风哭泣