K - Doing Homework again （贪心）

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

题目大意：
每个测试样例第一行给出作业的截止时间，第二行给出分数值，每做一个作业需要一天时间，没做出来的作业就扣除相应分数，求最少扣分为多少

解题思路：
贪心思想，优先考虑分数最高的作业，把作业尽可能地安排在截止日期之前做完，如果当天有安排了就考虑前一天。如果不能安排下了就无法完成

完整代码：

#include <iostream>
#include<algorithm>
using namespace std;
struct node{
	int a,b;
}c[1010];

bool cmp(node e,node f){
	return e.b>f.b;
}

int main()
{
	int t,n;
	cin>>t;
	while(t--){
		int g[1010]{0},sum=0;
		cin>>n;
		for(int i=0;i<n;i++){
			cin>>c[i].a;
		}
		for(int i=0;i<n;i++){
			cin>>c[i].b;
		}
		sort(c,c+n,cmp);	//排序 
		for(int i=0;i<n;i++){
			int flag=1;
			int d=c[i].a;
			while(d--){
				if(g[d]==0){
					g[d]=1;
					flag=0;
					break;
				}
			}
			if(flag){		//无法完成 
				sum+=c[i].b;
			}
		}
		cout<<sum<<endl;
	}
}