c/c++考场分排序

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

struct Student {
	char id[15];
	int score;
	int location_number;
	int local_rank;
}stu[30010];

bool cmp(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, k, num = 0;
	scanf_s("%d", &n); // 考场数 
	for (int i = 1; i <= n; i++) {
		scanf_s("%d", &k); // 该考场内人数
		for (int j = 0; j < k; j++) {
			scanf_s("%s %d", stu[num].id,15, &stu[num].score);
			stu[num].location_number = i; // 该考生的考场号为i
			num++;
		}
		sort(stu + num - k, stu + num, cmp); //将该考场的考生排序
		stu[num - k].local_rank = 1; // 该考场第1名的local_rank记为1
		for (int j = num - k + 1; j < num; j++) {
			if (stu[j].score == stu[j - 1].score) {
				stu[j].local_rank = stu[j - 1].local_rank;
			}
			else {
				stu[j].local_rank = j + 1 - (num - k);
			}
		}

	}
	printf("%d\n", num); // 输出总考生数 
	sort(stu, stu + num, cmp); // 将所有考生排序 
	int r = 1; // 当前考生的排名
	for (int i = 0; i < num; i++) {
		if (i > 0 && stu[i].score != stu[i - 1].score) {
			r = i + 1;
		}
		printf("%s ", stu[i].id);
		printf("%d %d %d\n", r, stu[i].location_number, stu[i].local_rank);
	}

	return 0;
}

输入：

2
3
1234001 92
1234004 98
1234003 89
2
1244003 78
1244001 90

输出：

5
1234004 1 1 1
1234001 2 1 2
1244001 3 2 1
1234003 4 1 3
1244003 5 2 2