# include <stdio.h>
# include <malloc.h>
struct Student
{
int num;
float score;
};
int main(void)
{
int len,no,count,cnt;
struct Student * pArr;
int i, j,k;
struct Student t;
//动态的构造一维数组
printf("请输入学生的个数:\n");
printf("len = ");
scanf("%d", &len);
pArr = (struct Student *)malloc(len * sizeof(struct Student));
//输入
for (i=0; i<len; ++i)
{
printf("请输入序号为%d的学生成绩:\n",
i+1);
pArr.num=i+1;
printf("score = ");
scanf("%f",
&pArr.score);
}
//按学生成绩排序 冒泡算法
for (i=0; i<len-1; ++i)
{
for (j=0; j<len-1-i; ++j)
{
if (pArr[j].score <
pArr[j+1].score)
{
t = pArr[j];
pArr[j] =
pArr[j+1];
pArr[j+1] = t;
}
}
}
printf("\n\n学生的成绩排序为:\n");
//输出
no=1;
cnt=1;
for(i=0;i<len;i++)
{
if(pArr.score > pArr[i+1].score)
{
printf("\n%d %f %d",no,pArr.score,cnt);
for(j=0;j<cnt;j++)
printf(" 1000%d ",pArr[i-j].num);
if(cnt%5==0)
printf("\n");
cnt=1;
no++;
}
else
{
cnt++;
}
}
printf("\n");
return 0;
}