Bone Collector II
Time Limit : 5000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 27 Accepted Submission(s) : 14
Problem Description
The title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't matter,I will give you a link:
Here is the link: http://acm.hdu.edu.cn/showproblem.php?pid=2602
Today we are not desiring the maximum value of bones,but the K-th maximum value of the bones.NOTICE that,we considerate two ways that get the same value of bones are the same.That means,it will be a strictly decreasing sequence from the 1st maximum , 2nd maximum .. to the K-th maximum.
If the total number of different values is less than K,just ouput 0.
Here is the link: http://acm.hdu.edu.cn/showproblem.php?pid=2602
Today we are not desiring the maximum value of bones,but the K-th maximum value of the bones.NOTICE that,we considerate two ways that get the same value of bones are the same.That means,it will be a strictly decreasing sequence from the 1st maximum , 2nd maximum .. to the K-th maximum.
If the total number of different values is less than K,just ouput 0.
Input
The first line contain a integer T , the number of cases. Followed by T cases , each case three lines , the first line contain two integer N , V, K(N <= 100 , V <= 1000 , K <= 30)representing the number of bones and the volume of his bag and the K we need. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.
Output
One integer per line representing the K-th maximum of the total value (this number will be less than 2[sup]31[/sup]).
Sample Input
3 5 10 2 1 2 3 4 5 5 4 3 2 1 5 10 12 1 2 3 4 5 5 4 3 2 1 5 10 16 1 2 3 4 5 5 4 3 2 1
Sample Output
12 2 0
题目代码:
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int N,V,K; ///N代表骨头的数量,V代表背包容量,K代表要找第K优解
int dp[1002][32]; ///dp[j][K]代表在容量为j的情况下的第k优解
int cost[103],value[103];
int A[32],B[32];
int main() {
int T;
scanf("%d",&T);
while(T--) {
scanf("%d%d%d",&N,&V,&K);
memset(dp,0,sizeof(dp));
for(int i = 1; i <= N; i++) {
scanf("%d",&value[i]);
}
for(int i = 1; i <= N; i++) {
scanf("%d",&cost[i]);
}
for(int i = 1; i <= N; i++) {
for(int j = V; j >= cost[i]; j--) {
for(int k = 1; k <= K; k++) { ///先复制没有装的值
A[k] = dp[j][k];
}
for(int k = 1; k <= K; k++) { ///在求装了的值。
B[k] = dp[j-cost[i]][k] + value[i];
}
A[K+1] = B[K+1] = -1;
int a,b,k;
a = 1;
b = 1;
k = 1;
while(k<=K && (A[a]!=-1||B[b]!=-1)) {
if(A[a] > B[b]) {
dp[j][k] = A[a];
a++;
} else {
dp[j][k] = B[b];
b++;
}
if(dp[j][k] != dp[j][k-1]) {
k++;
}
}
}
}
printf("%d\n",dp[V][K]);
}
return 0;
}