1028 List Sorting (25 分)

题目详情 - 1028 List Sorting (25 分) (pintia.cn)

代码：

#include<bits/stdc++.h>
using namespace std;
struct Node {
	string id, name;
	int score;
};
int N = 0, C= 0;
bool cmp(Node a, Node b) {
	if (C == 1) {
		return a.id < b.id;
	}else if (C == 2) {
		return a.name != b.name ? a.name < b.name : a.id < b.id;
	}else {
		return a.score != b.score ? a.score < b.score : a.id < b.id;
	}
}
int main()
{
	cin >> N >> C;
	vector<Node> v(N);
	for (int i = 0; i < N; ++i) {cin >> v[i].id >> v[i].name >> v[i].score;}
	sort(v.begin(), v.end(), cmp);
	for (int i = 0; i < N; ++i) {
		cout << v[i].id << ' ' << v[i].name << ' ' << v[i].score << endl;
	}
	return 0;
}