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.
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.
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
0 3 5思路 :分数优先由大到小排。 分数大的那个截止日期,一定要是由它用掉,如果当前的时间用过,就向前找,看有没有没有用的,,
代码
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<vector>
#define inf 0x3f3f3f
#define mod 100000
#define M 1000+10
using namespace std;
struct data
{
int day,score;
};
data a[M];
int cmp(data a,data b)
{
return a.score>b.score;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
int days=0;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i].day);
days=max(days,a[i].day);
}
int v[10000]={0};
for(int i=0;i<n;i++)
scanf("%d",&a[i].score);
sort(a,a+n,cmp);
int sum=0;
for(int i=0;i<n;i++)
{
if(v[a[i].day]==0)
v[a[i].day]=1;
else
{ int j;
for( j=a[i].day-1;j>=1;j--)
if(v[j]==0)
{
v[j]=1;
break;
}
if(j==0) sum+=a[i].score;
}
}
printf("%d\n",sum);
}
return 0;
}