Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 19756 Accepted Submission(s): 11430
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<bits/stdc++.h>
using namespace std;
#define ll long long
typedef struct
{
int x,y;///x截止日期,y分数
}node;
int mmp(node x,node y){
if(x.y!=y.y) return x.y>y.y;
return x.x>y.x;
}
int main(){
int t;
scanf("%d",&t);
node a[1010];
while(t--){
int n;
int dp[100000]={0};
int sum=0;
int mx=0;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i].x);
mx=mx<a[i].x?a[i].x:mx;
}for(int i=1;i<=n;i++){
scanf("%d",&a[i].y);
sum+=a[i].y;
}
sort(a+1,a+n+1,mmp);
for(int i=1;i<=n;i++){
int y=a[i].x;
for(;y>=1;y--){
if(dp[y]==0) {
dp[y]=1;
sum-=a[i].y;
break;
}
}
}
printf("%d\n",sum);
}
return 0;
}