—————————————————————————————————————————————————— 考察
还是不要int的格式化输出 要不用字符串存id。最后一组cin cout太慢了会超时，考这个点也是无语 #include<iostream> #include<algorithm> #include<cstring> using namespace std; struct student { char id[15]; char name[15]; int score; }stu[100001]; bool cmp1(student a, student b) { return strcmp(a.id, b.id) < 0; } bool cmp2(student a, student b) { if (strcmp(a.name, b.name) != 0) return strcmp(a.name, b.name) < 0; else return strcmp(a.id, b.id) < 0; } bool cmp3(student a, student b) { if (a.score != b.score) return a.score < b.score; else return strcmp(a.id, b.id) < 0; } int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { cin>>stu[i].id >> stu[i].name >> stu[i].score; } if (m == 1)sort(stu, stu + n, cmp1); else if (m == 2) sort(stu, stu + n, cmp2); else if (m == 3)sort(stu, stu + n, cmp3); for (int i = 0; i < n; i++) { printf("%s %s %d\n", stu[i].id, stu[i].name, stu[i].score); } }