杭电- 1789 Doing Homework again

最新推荐文章于 2020-02-08 20:42:53 发布

lu_1110

最新推荐文章于 2020-02-08 20:42:53 发布

阅读量254

点赞数

分类专栏： OJ练习

本文链接：https://blog.csdn.net/lu_1110/article/details/51994541

版权

OJ练习专栏收录该内容

218 篇文章 0 订阅

订阅专栏

Doing Homework again

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 11256 Accepted Submission(s): 6604

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

  
  
   
   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

Author

lcy

Source

2007省赛集训队练习赛（10）_以此感谢DOOMIII

AC代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
	int t;
	int c;
} a[1100];
bool cmp(node A,node B)
{
	return A.c>B.c;
}
int main()
{
	int n,i,j,t,flag;
	int b[1110];
	scanf("%d",&t);
	while(t--)
	{
		memset(b,0,sizeof(b));
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i].t);
		}
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i].c);
		}
		sort(a,a+n,cmp);
		int sum=0;
		for(i=0;i<n;i++)
		{
			 flag=0;
			for(j=a[i].t;j>0;j--)
			{
				if(b[j]==0)
				{
					b[j]=1;
				    flag=1;
				    break;
				}
				
			}
			if(flag==0)
			sum=sum+a[i].c;
		}
		
		printf("%d\n",sum);
	}
	return 0;
}