HDU 2639 Bone Collector II

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.

 

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 ³¹).

 

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
  
  
  
  


  
  
  
  


  
  
  
  

   
   题目意思：要求01背包的第k个最优解
  
  
  
  

   
   分析：用dp[j][k]表示容量为j的第k个最优解
  
  
  
  

   
   分别用两个一维数组来记录取和不取第i件物品的的解，那么两个数组所存的解共有2*k个，现在题目只要我们求这2*k个解的第k大的是多少，合并这两个数组直到第k个。
  
  
  
  


  
  
  
  

   
   代码：
  
  
  
  

   
   

    
    

     
     
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int val[1050],w[1050];
int dp[1050][35];
int a[35],b[35];

int main ()
{
    int t,n,v,k,i,j,l,x,y,z;
    scanf("%d",&t);
    while (t--)
    {
       scanf("%d%d%d",&n,&v,&k);
       memset(dp,0,sizeof(dp));
       for (i = 1; i <= n; i++)
       {
          scanf("%d",&val[i]);
       }
       for (i = 1; i <= n; i++)
       {
           scanf("%d",&w[i]);
       }
       for (i = 1; i <= n; i++)
       {
           for (j = v; j >= w[i]; j--)
           {
               for (l = 1; l <= k; l++)
               {
                   a[l] = dp[j][l];//不取
                   b[l] = dp[j-w[i]][l]+val[i];//取
               }
               x = y = z = 1;
               a[k+1] = -1;//保证下面访问不越界
               b[k+1] = -1;
               while (z<= k && (a[x]!=-1||b[y]!=-1))
               {
                   if (a[x] > b[y])
                   {
                       dp[j][z] = a[x];
                       x++;
                   }
                   else
                   {
                       dp[j][z] = b[y];
                       y++;
                   }
                   if (dp[j][z] != dp[j][z-1])//不同的值才要
                   {
                       z++;
                   }
               }
           }
       }
       cout << dp[v][k] << endl;

    }

    return 0;
}