题目链接: 点击打开链接
题目大意: 背包装骨头,求第k大的骨头价值
思路: 动态规划,01背包
分析:
01背包变形,求第k大的价值。那么dp数组每个单元存的就不是当前状态最优价值了,而是一个长度为k的序列,存放前k个骨头价值。状态转换时,对于某块骨头如果放,那么将dp[j-vol[i]]的序列中的所有值加上val[i];如果不放,保持原样。将这两个序列合并排序取前k个,就是dp[j]的新序列。要注意去重,因为前k个骨头价值要严格递减。
代码:
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100 + 10;
const int maxv = 1000 + 10;
const int maxk = 65;
int n, v, k, vol[maxn], val[maxn], dp[maxv][maxk];
bool comp(int a, int b)
{
return a > b;
}
void solve()
{
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; ++i)
for (int j = v; j >= vol[i]; --j)
{
int temp[maxk], pos = 0;
for (int p = 0; p < k; ++p)
temp[pos++] = dp[j][p];
for (int p = 0; p < k; ++p)
temp[pos++] = dp[j-vol[i]][p] + val[i];
sort(temp, temp + 2 * k, comp);
dp[j][0] = temp[0];
pos = 1;
for (int p = 1; p < k && pos < 2 * k; ++pos)
if (temp[pos] != temp[pos-1])
dp[j][p++] = temp[pos];
}
}
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
scanf("%d %d %d", &n, &v, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", &val[i]);
for (int i = 1; i <= n; ++i)
scanf("%d", &vol[i]);
solve();
printf("%d\n", dp[v][k-1]);
}
return 0;
}