题解 | EXCEL排序

	#include<bits/stdc++.h>
	using namespace std;

	struct stu {
		string idx;
		string name;
		int score=0;
	};
	bool cmp1(stu u1, stu u2) {
		return u1.idx < u2.idx;
	}
	bool cmp2(stu u1, stu u2) {
		if(u1.name==u2.name)
			return u1.idx < u2.idx;
		else
			return u1.name < u2.name;
	}
	bool cmp3(stu u1, stu u2) {
		if(u1.score==u2.score)
			return u1.idx < u2.idx;
		else
		    return u1.score < u2.score;
	}
	int main() {
		int n, c;
		cin >> n >> c;
		vector<stu> v(n);
		for (int i = 0; i < n; i++) {
			cin >> v[i].idx >> v[i].name >> v[i].score;
		}
		switch (c) {
		case 1:
			sort(v.begin(), v.end(), cmp1);
			break;
		case 2:
			sort(v.begin(), v.end(), cmp2);
			break;
		case 3:
			sort(v.begin(), v.end(), cmp3);
			break;
		}
		cout << "Case:" << endl;
		for (int i = 0; i < n; i++) {
			cout << v[i].idx << " " << v[i].name << " " << v[i].score << endl;
		}
		return 0;
	}