使用sort进行排序（1028 List Sorting (25分)）

题目描述

Excel can sort records according to any column. Now you are supposed to imitate this function.

Input Specification:
Each input file contains one test case. For each case, the first line contains two integers N (≤10^​5) and C, where N is the number of records and C is the column that you are supposed to sort the records with. Then N lines follow, each contains a record of a student. A student’s record consists of his or her distinct ID (a 6-digit number), name (a string with no more than 8 characters without space), and grade (an integer between 0 and 100, inclusive).

Output Specification:
For each test case, output the sorting result in N lines. That is, if C = 1 then the records must be sorted in increasing order according to ID’s; if C = 2 then the records must be sorted in non-decreasing order according to names; and if C = 3 then the records must be sorted in non-decreasing order according to grades. If there are several students who have the same name or grade, they must be sorted according to their ID’s in increasing order.

注意点：

1、注意：sort的使用方式为：sort(首元素地址(必填),尾元素地址的下一个地址(必填),比较函数(非必填));着重注意理解第二项为尾元素地址的下一个地址；
并且，注意在for循环使用i=1作为起始地址时，再使用sort排序需要注意首地址和尾地址都需要做对应的变化。

#define _CRT_SECURE_NO_DEPRECATE //定义CRT安全无弃用
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 100010;
struct Student {
	//char id[8];
	int id;
	char name[10];
	int grade;
}stu[N];
bool cmp1(Student a, Student b) {
	//if (strcmp(a.id, b.id))return strcmp(a.id, b.id) < 0;
	if (a.id != b.id)return a.id < b.id;
}
bool cmp2(Student a, Student b) {
	if (strcmp(a.name, b.name))return strcmp(a.name, b.name) < 0;
	//else return strcmp(a.id, b.id) < 0;
	else return a.id < b.id;
}
bool cmp3(Student a, Student b) {
	if (a.grade != b.grade)return a.grade < b.grade;
	//else return strcmp(a.id, b.id) < 0;
	else return a.id < b.id;
}
int main()
{
	int n, c;
	scanf("%d%d", &n, &c);
	for (int i = 1; i <= n; i++) {
		//scanf("%s %s %d", stu[i].id, stu[i].name, &stu[i].grade);
		scanf("%d %s %d", &stu[i].id, stu[i].name, &stu[i].grade);
	}
	if (c == 1)sort(stu + 1, stu + n + 1, cmp1);//注意：sort的使用方式为：sort(首元素地址(必填),尾元素地址的下一个地址(必填),比较函数(非必填));
	else if(c == 2) sort(stu + 1, stu + n + 1, cmp2);//着重注意第二项为尾元素地址的下一个地址
	else sort(stu + 1, stu + n + 1, cmp3);
	for (int i = 1; i <= n; i++) {
		//printf("%s %s %d\n", stu[i].id, stu[i].name, stu[i].grade);
		printf("%06d %s %d\n", stu[i].id, stu[i].name, stu[i].grade);
	}
	return 0;
}