Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10533 Accepted Submission(s): 6168
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.
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
Author
lcy
Source
先对分数进行排序,从大到小排,从第一个开始遍历,如果该作业截至日期那天没有被用掉,就安排到当天完成,否则,向前找一天没有被用掉的安排该作业。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
int day,pri;
}p[1010];
bool cmp(node a,node b){
return a.pri>b.pri;
}
int flag[1010][2];
int main(){
int t,n,i,ans,ret;
scanf("%d",&t);
while( t-- ){
scanf("%d",&n);
ans = 0;
memset(flag,0,sizeof(flag));
for( i = 1 ; i <= n ; ++i ){
scanf("%d",&p[i].day);
}
for( i = 1 ; i <= n ; ++i ){
scanf("%d",&p[i].pri);
ans += p[i].pri;
}
sort(p+1,p+n+1,cmp);
ret = 0;
for( i = 1 ; i <= n ; ++i ){
if( flag[p[i].day][0] == 0 ){
flag[p[i].day][0] = 1;
flag[p[i].day][1] = i;
ret += p[i].pri;
}
else{
for( int k = p[i].day ; k > 0 ; --k ){
if( flag[k][0] == 0 ){
flag[k][0] = 1;
flag[k][1] = i;
ret += p[i].pri;
break;
}
}
}
}
printf("%d\n",ans-ret);
}
return 0;
}