Doing Homework again

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14545    Accepted Submission(s): 8475

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

333 3 310 5 131 3 16 2 371 4 6 4 2 4 33 2 1 7 6 5 4

 

Sample Output

035

 

Author

lcy

 

思路：先按照扣分从大到小排序，分数相同则按照截止日期从小到大排序。 然后枚举截止的时间，若是某一天没有被标记，就用这一天来完成这一门作业，若是枚举到0了，说明在限定时间内没有哪一天可以完成这门作业，那么就扣除这门课的分数......

#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;struct Node{int d;int p;}node[1002];int cmp(Node a,Node b){return a.p>b.p;}int main(){int t;scanf("%d",&t);while(t--){int n;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].p);sort(node,node+n,cmp);int vis[10001];memset(vis,0,sizeof(vis));int sum=0;for(int i=0;i<n;i++){int j;for(j=node[i].d;j>=1;j--){if(!vis[j]){vis[j]=1;break;}}if(j==0){sum+=node[i].p;}}printf("%d\n",sum);}}