Doing Homework again 杭电 1789

最新推荐文章于 2019-03-07 13:07:19 发布

「已注销」

最新推荐文章于 2019-03-07 13:07:19 发布

阅读量287

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qianmengfusheng/article/details/49125765

本文探讨了排序算法（冒泡排序）的应用，以及在处理考试成绩数据时如何使用数据结构（数组）进行优化。通过读取考试信息，包括考试日期、成绩和考试次数，程序实现了成绩排序和成绩获取功能，最终计算并输出了未获取的成绩总和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<stdio.h>
void bubble_sort(int score[],int number);
int expiry_day[1100];
int reduced_score[1100];
int can_got_score[1100];

int main()
{
	int number_of_test_cases;
	int number_of_subject;
	while( scanf("%d",&number_of_test_cases)!=EOF )
	{
		while(number_of_test_cases--)
		{
			for(int index=0; index<1010; index++)
			{
				can_got_score[index]=0;
			}
			int max_expriy_day=0;
			scanf("%d",&number_of_subject);
			for(int index=0; index<number_of_subject; index++)
			{
				scanf("%d",&expiry_day[index]);
				if(expiry_day[index]>max_expriy_day)
				{
					max_expriy_day=expiry_day[index];
				}
			}
			int sum_subject_score=0;
			for(int index=0; index<number_of_subject; index++)
			{
				scanf("%d",&reduced_score[index]);
				sum_subject_score+=reduced_score[index];
			}
			bubble_sort(reduced_score,number_of_subject);
			for(int now, index=0; index<number_of_subject; index++)
			{
				now=expiry_day[index];
				for(; now>=0; now--)
				{
					if(can_got_score[ now ]==0)
					{
						can_got_score[ now ]=reduced_score[index];
						break;
					}
				}
			}
			int sum_can_got_score=0;
			for(int index=1; index<=max_expriy_day; index++)
			{
				sum_can_got_score+=can_got_score[index];
			}
			printf("%d\n",sum_subject_score-sum_can_got_score);
		}
	}
}

void bubble_sort(int score[],int number)
{
	int t; 
	for(int i=1; i<number; i++)
	{
		for(int j=number-1; j>=i; j--)
		{
			if(score[j]>score[j-1])
			{
				t=reduced_score[j];
				reduced_score[j]=reduced_score[j-1];
				reduced_score[j-1]=t;
				t=expiry_day[j];
				expiry_day[j]=expiry_day[j-1];
				expiry_day[j-1]=t;
			}
		}
	}
}