A[1062]德才论 好题

A[1062]德才论 排序

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct Student {
	char id[10];
	int de;
		int cai;
		int sum;
		int flag;
}stu[100010];
bool cmp(Student a, Student b) {
	if (a.flag != b.flag)return a.flag < b.flag;
	else if (a.sum != b.sum)return a.sum > b.sum;
	else if (a.de != b.de)return a.de > b.de;
	else return strcmp(a.id, b.id) < 0;
}
int main() {
	int n, l, h, m;
	scanf("%d%d%d", &n, &l, &h);
	m = n;//m用于记录合格的人数
	for (int i = 0; i < n; i++) {
		scanf("%s%d%d", stu[i].id, &stu[i].de, &stu[i].cai);
		stu[i].sum = stu[i].de + stu[i].cai;
		if (stu[i].de<l|| stu[i].cai < l){stu[i].flag=5;
        m--;}

		else if (stu[i].de >= h && stu[i].cai >= h)stu[i].flag = 1;
		else if (stu[i].cai < h&&stu[i].de >= h)stu[i].flag = 2;//>=
		else if (stu[i].de >= stu[i].cai)stu[i].flag = 3;
		else stu[i].flag = 4;
	}
	sort(stu, stu + n,cmp);//别忘了cmp
	printf("%d\n", m);
	for (int i = 0; i < m; i++) {
		printf("%s %d %d\n", stu[i].id, stu[i].de, stu[i].cai);//换行
}
	return 0;


}