HDU 1789 - Doing Homework again

最新推荐文章于 2020-09-07 17:28:41 发布

原创最新推荐文章于 2020-09-07 17:28:41 发布 · 348 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#hdu

ACM - 贪心专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个关于作业安排的问题，使用贪心算法来最小化因延期交作业而被扣除的成绩分数。通过按扣分多少及截止日期排序作业，合理安排完成顺序。

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13421 Accepted Submission(s): 7816

Problem Description

Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his score of the final test. And now we assume that doing everyone homework always takes one day. So Ignatius wants you to help him to arrange the order of doing homework to minimize the reduced score.

Input

The input contains several test cases. The first line of the input is a single integer T that is the number of test cases. T test cases follow.
Each test case start with a positive integer N(1<=N<=1000) which indicate the number of homework.. Then 2 lines follow. The first line contains N integers that indicate the deadlines of the subjects, and the next line contains N integers that indicate the reduced scores.

Output

For each test case, you should output the smallest total reduced score, one line per test case.

Sample Input

3
3
3 3 3
10 5 1
3
1 3 1
6 2 3
7
1 4 6 4 2 4 3
3 2 1 7 6 5 4

Sample Output

0
3
5

    第一步按照reduced_score从大到小排序，如果reduced_score相等，则按照deadline从小到大排。
    然后开始选择，让当前的课排在其deadline上面，如果这一天已经被占用了，
	那么就往前循环，有位置了就安排，没了就sum+=reduced_score

#include<cstdio>
#include<algorithm>
using namespace std;
typedef struct{
	int deadline;
	int reduced_score;
}type;
type homework[1003];
int day[1100];
bool cmp(type a,type b)
{
	if(a.reduced_score == b.reduced_score) return a.deadline < b.deadline;
	return a.reduced_score > b.reduced_score;
}
int main()
{
	int t,n;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		int deadline_max=-1;
		for(int i=1;i<=n;i++){
			scanf("%d",&homework[i].deadline);
			if(homework[i].deadline > deadline_max) deadline_max=homework[i].deadline;
		}
		for(int i=1;i<=n;i++) scanf("%d",&homework[i].reduced_score);
		sort(homework+1,homework+n+1,cmp);

		int reduced_score_sum=0;
		memset(day,0,sizeof(day));
		for(int i=1;i<=n;i++){
			int j;
			for(j=homework[i].deadline;j>=1;j--){
				if(day[j]==0){
					day[j]=1;
					break;
				}
			}
			if(j==0) reduced_score_sum+=homework[i].reduced_score; //反正分也扣了，一百年之后再做也没事，就不用去管哪天做了 
		}
		printf("%d\n",reduced_score_sum); 
	}
}