题解 | 成绩排序

#include <iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
struct student {
	int number;
	int score;
};
const int  maxn = 100;
student  arr[maxn];
bool compare(student l, student r) {
	if (l.score == r.score) {
		return l.number < r.number;
	}
	else return l.score < r.score;
}
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int a, b;
		cin >> a >> b;
		arr[i].number = a;
		arr[i].score = b;
	}
	sort(arr, arr + n, compare);
	for (int i = 0; i < n; i++) {
		cout << arr[i].number << " " << arr[i].score<<endl;
	}
}