Bone Collector II
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 917 Accepted Submission(s): 437
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.
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 231).
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
1 /* 2 第K优解问题 3 4 其基本思想是将每个状态都表示成有序队列，将状态转移方程中的max/min转化成有序队列的合并。这里仍然以01背包为例讲解一下。 5 首先看01背包求最优解的状态转移方程：f[i][v]=max{f[i-1][v],f[i-1][v-c[i]]+w[i]}。如果要求第K优解，那么状态f[i][v]就应该是一个大小为K的数组f[i][v][1..K]。其中f[i][v][k]表示前i个物品、背包大小为v时，第k优解的值。 “f[i][v]是一个大小为K的数组”这一句，熟悉C语言的同学可能比较好理解，或者也可以简单地理解为在原来的方程中加了一维。显然f[i][v] [1..K]这K个数是由大到小排列的，所以我们把它认为是一个有序队列。 6 然后原方程就可以解释为：f[i][v]这个有序队列是由f[i-1][v]和f[i-1][v-c[i]]+w[i]这两个有序队列合并得到的。有序队列 f[i-1][v]即f[i-1][v][1..K]，f[i-1][v-c[i]]+w[i]则理解为在f[i-1][v-c[i]][1..K]的每个数上加上w[i]后得到的有序队列。合并这两个有序队列并将结果的前K项储存到f[i][v][1..K]中的复杂度是O(K)。最后的答案是f[N] [V][K]。总的复杂度是O(VNK)。 7 8 01背包再清楚不过了，主要还是是有序队列合并的问题。 9 10 */ 11 #include <iostream> 12 #include <cstring> 13 #include <cstdio> 14 #include <algorithm> 15 using namespace std; 16 17 int dp[1005][70],w[1005],v[1005],temp[105]; 18 int a[50],b[50]; 19 20 int main() 21 { 22 int num,V,K,cnt; 23 int i,j,k,T; 24 scanf("%d",&T); 25 while(T--) 26 { 27 scanf("%d%d%d",&num,&V,&K); 28 memset(dp,0,sizeof(dp)); 29 for(i=1;i<=num;i++) 30 scanf("%d",&v[i]); 31 for(i=1;i<=num;i++) 32 scanf("%d",&w[i]); 33 for(i=1;i<=num;i++) 34 { 35 for(j=V;j>=w[i];j--) 36 { 37 cnt=0; 38 for(k=1;k<=K;k++) 39 { 40 temp[cnt++]=dp[j][k]; 41 temp[cnt++]=dp[j-w[i]][k]+v[i]; 42 } 43 sort(temp,temp+cnt); 44 int x=1; 45 for(k=cnt-1;k>=0;k--) 46 { 47 if(x>K) 48 break; 49 if(k==cnt-1||temp[k]!=temp[k+1]) 50 dp[j][x++]=temp[k]; 51 } 52 } 53 } 54 printf("%d\n",dp[V][K]); 55 } 56 return 0; 57 }