统计成绩

题目如下

在这里插入图片描述

代码

#include<stdio.h>
int main()
{
	int n, i, j, a[9], min,max, t;
	int xuehao[9], fengshu[9],xhao[9],fshu[9];
	char xingming[9][9];
	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d%s%d", &xuehao[i], &xingming[i], &fengshu[i]);
	for(i=0;i<n;i++)
		xhao[i]=xuehao[i];
	for(i=0;i<n;i++)
	fshu[i]=fengshu[i];
		
	for (j = 0; j < n; j++)
	{
		min = 9999; 
		for (i = 0; i < n; i++)
		{
			if (xhao[i] < min)
			{
				min = xhao[i];
				t = i;
			}
		}
		xhao[t] = 9999;
		a[j] = t;
	}
	for (i = 0; i < n; i++)
		printf("%d\t%s\t%d\n", xuehao[a[i]], xingming[a[i]], fengshu[a[i]]);
	printf("\n");
	
	for (j = 0; j < n; j++)
	{
		max =-1; 
		for (i = 0; i < n; i++)
		{
			
			if (fshu[i] >=max)
			{
				if(fshu[i] !=max)
				{
			     max = fshu[i];
			     t=i;
				}
				else
				{
				if(xuehao[i]<xuehao[t])
				t=i;
				}
			}
		}
		fshu[t] = -2;
		a[j] = t;
	}
	for (i = 0; i < n; i++)
		printf("%d\t%s\t%d\n", xuehao[a[i]], xingming[a[i]], fengshu[a[i]]);	
	return 0;
}

运行截图

在这里插入图片描述

猜你喜欢

转载自blog.csdn.net/qq_42837885/article/details/84940470