PAT 1083 排序

题目

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.

代码及思路

1. 很简单的一道排序题，而且整体测试点不多，可以用string和cin读入输出，很方便
2. 这里是在最后给出了成绩范围，所以要先都读入，然后两个指针一前一后筛掉不满足条件的人
3. 若前向指针大于了后向，那证明就没有符合条件的了

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;

struct student {
	string name;
	string Id;
	int grade;
}temp;

vector<student> stu;

bool cmp(student a, student b) {
	return a.grade > b.grade;
}

int main() {
	string name, id;
	int grade;
	int n;
	int grade1, grade2;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		cin >> temp.name >> temp.Id >> temp.grade;
		stu.push_back(temp);
	}
	cin >> grade2 >> grade1;
	sort(stu.begin(), stu.end(), cmp);
	int i = 0;
	int j = stu.size() - 1;
	int indexi, indexj;
	int flagi = false, flagj = false;
	while (i <= j && (!flagi || !flagj)) {
		if (stu[i].grade > grade1) i++;
		else flagi = true;
		if (stu[j].grade < grade2) j--;
		else flagj = true;
	}
	if (i > j) {
		printf("NONE");
	}
	else {
		for (; i <= j; i++) {
			cout << stu[i].name << " " << stu[i].Id << endl;
		}
	}
	return 0;
}