贪心--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

t组测试数据，每组测试数据中有n门功课，第一排完成它们的时间限制，第二排是未在限制的时间内完成的要扣除的分数，然后是需要求扣的分数最少。

 简单贪心，一开始没想到思路。

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

#include

#include

#include

using namespace std;

struct Hw

{

 int date;

 int score;

}hw[1005];

int schedule[1005];

bool cmp(const Hw a, const Hw b)

{

 return a.score > b.score;

}

int main()

{

 int T;

 scanf("%d", &T);

 while (T--)

 {

  int ans = 0;

  memset(schedule, 0, sizeof(schedule));

  int N;

  scanf("%d", &N);

  for (int i = 0; i < N; i++)

   scanf("%d", &hw[i].date);

  for (int i = 0; i < N; i++)

   scanf("%d", &hw[i].score);

  sort(hw, hw + N,cmp);

  for (int i = 0; i < N; i++)

  {

   int flag = 0;

   for (int j = hw[i].date; j>0;j--)

   if (!schedule[j])

   {

    schedule[j] = 1;

    flag = 1;

    break;

   }

   if (!flag)

    ans += hw[i].score;

  }

  cout << ans << endl;

 }

 return 0;

}