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
0
3
5
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
struct deadline
{
int days;
int score;
};
int main()
{
int N;
scanf("%d", &N);
while (N--)
{
int n;
scanf("%d", &n);
bool Days[1001];
memset(Days, 0, sizeof(Days));
vector<deadline>test(n);
for (int i = 0; i < n; i++)
scanf("%d", &test[i].days);
for (int i = 0; i < n; i++)
scanf("%d", &test[i].score);
int minscore = 0;
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if (test[i].score < test[j].score)
{
swap(test[i], test[j]);
}
else if (test[i].score == test[j].score)
{
if (test[i].days > test[j].days)
swap(test[i], test[j]);
}
}
}
for (int i = 0; i < n; i++)
{
int j;
for (j = test[i].days; j >= 1; j--)
{
if (!Days[j])
{
Days[j] = 1;
break;
}
}
if (j == 0)
minscore += test[i].score;
}
cout << minscore << endl;
}
return 0;
}