HDU 1789 Doing Homework again

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1789

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
  
  

题目大意：第一行输入表示T个测试例子，接下来的每个例子包括n个作业，每个作业有最后提交的期限（剩下多少天）和若未完成相应扣的分数（第二行）。贪心法，为了最小化扣的分数，对分数从大到小排序，优先完成分值大的作业。标记一下完成的作业，最后即可算出扣的分数。

代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
#define N 1001
typedef struct{
	int deadline;
	int reduced;
	int status;
}homework;
homework score[N];
bool cmp(homework a,homework b){
	if(a.reduced==b.reduced)
		return a.deadline<b.deadline;
	return a.reduced>b.reduced;
}
int main()
{
//	freopen("E:\\in.txt","r",stdin);
	int T;
	cin>>T;
	while(T--){
		int done[N];
		memset(done,0,sizeof(done));
		int n,i,j,res=0;
		cin>>n;
		for(i=0;i<n;i++)
			cin>>score[i].deadline;
		for(i=0;i<n;i++)
			cin>>score[i].reduced;
		for(i=0;i<n;i++)
			score[i].status=0;
		sort(score,score+n,cmp);
//		for(i=0;i<n;i++)		//查看排序后的结果
//			cout<<score[i].deadline<<" "<<score[i].reduced<<endl;
//		cout<<endl;
		for(i=0;i<n;i++){
			for(j=score[i].deadline-1;j>=0;j--){
				if(done[j]==0){
					done[j]=1;
					score[i].status=1;//标记该项已完成
//					cout<<score[i].deadline<<" "<<score[i].reduced<<endl;
					break;
				}
			}
			if(score[i].status==0){
				res+=score[i].reduced;
//				cout<<score[i].deadline<<" "<<score[i].reduced<<endl;
			}
		}
		cout<<res<<endl;	
	}
	return 0;
}