Doing Homework again

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. 

题意就是 一个hdu的神牛从world final英勇归来了。然后他要补作业。。

一共n个作业 完成每个作业都需要一天。但是每个作业有截止日期 如果超过了截止日期 就会扣分 

给出 n个作业的截止日期 和 如果超过截止日期要扣的分 现在要计算 怎么设计做作业的顺序扣分最少 计算出这个最少的扣分值

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.

SampleInput

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

SampleOutput

0
3
5

先按照扣分从大到小排序，分数相同则按照截止日期从小到大排序。。

 

然后按顺序，从截止日期开始往前找没有占用掉的时间。

如果找不到了，则加到罚分里面

 

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int MAXN=1010;

struct Node
{
    int d,s;
}node[MAXN];

bool used[10000];

bool cmp(Node a,Node b)       //先按扣分从大到小排，若相等按时间从小到大排
{
    if(a.s==b.s)
    {
        return a.d<b.d;
    }    
    return a.s>b.s;
}        

int main()
{
    int T;
    int n;
    int j;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i=0;i<n;i++) scanf("%d",&node[i].d);
        for(int i=0;i<n;i++) scanf("%d",&node[i].s);
        sort(node,node+n,cmp);
        memset(used,false,sizeof(used));
        int ans=0;
        for(int i=0;i<n;i++)
        {
            for(j=node[i].d;j>0;j--)          //j指向node[i]的截止日期，从j开始往前找，如果有空闲时间则标记为true
            {
                if(!used[j])
                {
                    used[j]=true;
                    break;
                }    
            }    
            if(j==0)                  //如果找到第1天也没有则需要加到扣分ans中
              ans+=node[i].s;
        }    
        printf("%d\n",ans);
    }    
    return 0;
}