贪心-J

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

输入n门课作业的截止时间和所罚的分数，求最小的罚分是多少。
按照成绩从高到低排序，最高的刚好在截止日期那一天交，如果截止日期被占用，则往前推一天交，一次类推，如果到第一天都被占用，则跳出循环，输出没有提交的成绩和。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
struct note
{
    int time;
    int score;
}a[1005];
bool cmp(note a,note b)
{
    if(a.score==b.score)
    return a.time>b.time;
    else
    return a.score>b.score;
}
int main()
{
    int t,n;
    int flag[1005];
    cin>>t;
    while(t--)
    {
        memset(flag,0,sizeof(flag));
        cin>>n;
        for(int i=0;i<n;i++)
        cin>>a[i].time;
        for(int j=0;j<n;j++)
        cin>>a[j].score;
        sort(a,a+n,cmp);
        int sum=0;
        for(int i=0;i<n;i++)//每一组数据都要进行判断
        {
            for(int j=a[i].time;j>0;j--)//从截止日期判断，如果没被占用就占用这一天，若是被占用则往前推一天
            {
                if(!flag[j])
                {
                    flag[j]=1;
                    break;
                }
                else if(j==1)//直到第一天都被占用，则输出该成绩
                {
                    sum+=a[i].score;
                }
            }
        }
        cout<<sum<<endl;
    }
}