题目见PAT官网~~~
输入样例:
14 60 80
10000001 64 90
10000002 90 60
10000011 85 80
10000003 85 80
10000004 80 85
10000005 82 77
10000006 83 76
10000007 90 78
10000008 75 79
10000009 59 90
10000010 88 45
10000012 80 100
10000013 90 99
10000014 66 60
输出样例:
12
10000013 90 99
10000012 80 100
10000003 85 80
10000011 85 80
10000004 80 85
10000007 90 78
10000006 83 76
10000005 82 77
10000002 90 60
10000014 66 60
10000008 75 79
10000001 64 90
解题代码:
#include <stdio.h>
#include <stdlib.h>
typedef struct{
int num;//准考证号
int de;//德分
int cai;//才分
}same;
int cap(const void *a,const void *b){
same s1 = *(same *)a;
same s2 = *(same *)b;
if((s1.de +s1.cai) != (s2.de+s2.cai)){//总分降序
return (s2.de+s2.cai)>(s1.de+s1.cai);
} else if(s1.de != s2.de){//德分降序
return s2.de > s1.de;
}else{
return s1.num >s2.num;//准考证号升序
}
}
int main(){
int n,l,h;//考生总数、最低和最高分数线
scanf("%d %d %d",&n,&l,&h);
int num,de,cai;//准考证号、德分、才分
int cao[4] = {0};//四类考生的数量
same order[4][n];
while(n-->0){//读入考生信息
scanf("%d %d %d",&num,&de,&cai);
if(de>=l&&cai>=l){//如果达到最低分数线
same s={num,de,cai};//创建考生
if(de>=h&&cai>=h){//德才全尽
order[0][cao[0]++] = s;
}else if(de >=h&&cai<h){//德胜才
order[1][cao[1]++] = s;
}else if(de<h&&cai<h&&de>=cai){//才德兼亡尚有德胜才
order[2][cao[2]++] = s;
}else{
order[3][cao[3]++] = s;
}
}
}
printf("%d\n",cao[0]+cao[1]+cao[2]+cao[3]);
int i,j;
for(i=0;i<4;i++){//遍历四个分类,进行排序
qsort(order[i],cao[i],sizeof(order[i][0]),cap);
for(j=0;j<cao[i];j++){//依次输出
printf("%08d %d %d\n",order[i][j].num,order[i][j].de,order[i][j].cai);
}
}
return 0;
}