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<bits/stdc++.h>
using namespace std;
int t,n,sum;
struct node
{
int score;//分
int linet;//截止日期
int flag;//标记
}p[1010];
int cmp(node p1,node p2)
{
if(p1.linet==p2.linet)
return p1.score>=p2.score;
else
return p1.linet<=p2.linet;
}
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&p[i].linet);
for(int i=0;i<n;i++)
{
scanf("%d",&p[i].score);
p[i].flag=0;
}
sort(p,p+n,cmp);
int k=1;
sum=0;
for(int i=0;i<n;i++)
{
if(p[i].linet>=k)
k++;
else
{
int pos=p[i].score;
int temp=i;
for(int j=0;j<i;j++)
// 剔除前面做小的,找出当前最小的需要标记在未被剔除中找
if(pos>p[j].score&&p[j].flag==0)
{
pos=p[j].score;
temp=j;
}
sum+=pos;
p[temp].flag=1;
}
}
printf("%d\n",sum);
}
}