题目
思路
题目大意:根据不同的排序标准进行排序;
核心就是那三个比较函数;
直接上代码吧,不难理解;
代码
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 1e5 + 10;
struct stu{
int id, grade;
char name[10];
}v[maxn];
bool cmp1(stu a, stu b){
return a.id < b.id;
}
bool cmp2(stu a, stu b){
int s = strcmp(a.name, b.name);
if(s != 0) return s < 0;
else return a.id < b.id;
}
bool cmp3(stu a, stu b){
if(a.grade != b.grade) return a.grade < b.grade;
else return a.id < b.id;
}
int main()
{
int n, c;
scanf("%d%d", &n, &c);
for(int i = 0; i < n; i ++){
scanf("%d %s %d", &v[i].id, v[i].name, &v[i].grade);
}
if(c == 1) sort(v, v + n, cmp1);
else if(c == 2) sort(v, v + n, cmp2);
else sort(v, v + n, cmp3);
for(int i = 0; i < n; i ++){
printf("%06d %s %d\n", v[i].id, v[i].name, v[i].grade);
}
system("pause");
return 0;
}