HDU 2639（01背包求第K大值）

最新推荐文章于 2022-09-09 22:07:37 发布

Y先森0.0

最新推荐文章于 2022-09-09 22:07:37 发布

阅读量349

点赞数

本文链接：https://blog.csdn.net/qq_39382769/article/details/80485856

版权

本文介绍了HDU 2639题目——Bone Collector II，这是一道关于01背包问题的算法题。参赛者需在限定的时间和内存限制下，解决如何找到第K大的数值。目前该题已有大量提交，但通过率相对较低。

摘要由CSDN通过智能技术生成

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=2639

Bone Collector II

Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5817 Accepted Submission(s): 3067

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