1028 List Sorting (25分)（一个字短！）

1028 List Sorting (25分)

分析

注意比较函数和结构体应尽量有助于缩短排序时间

代码

#include<iostream>
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
using namespace std;
int n, a;
struct node {
 int id, score;
 string name;
 node() {}
 node(int d, string m, int s) :id(d), name(m), score(s) {}
};
bool cmp(node x, node y) {
 if (a == 1)return x.id < y.id;
 else if (a == 3)return x.score == y.score ? x.id < y.id : x.score < y.score;
 return strcmp(x.name.c_str(), y.name.c_str()) == 0 ? x.id < y.id : strcmp(x.name.c_str(), y.name.c_str()) < 0;
}
int main() {
 cin >> n >> a;
 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)
  printf("%06d %s %d\n", v[i].id, v[i].name.c_str(), v[i].score);
 return 0;
}