HDOJ2639(01背包第k最优解模板题)

#include <iostream> 
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <math.h>
#include<iostream>
#include <map>

using namespace std;
#define INF  0xfffff;//0x代表十六进制
#define M 1050

int dp[M][M], b[M], c[M];   //dpij指质量为i时的第j种最优解决方案

struct aa
{
	int w, v;
}a[M];

int main()
{
	int t;
	cin >> t;
	for (int i = 0; i < t; i++)
	{
		memset(dp, 0, sizeof(dp));
		int n, v, k, x, y, z, k1;
		cin >> n >> v >> k;
		for (int i = 0; i < n; i++) cin >> a[i].v;
		for (int i = 0; i < n; i++) cin >> a[i].w;

		for (int i = 0; i < n; i++)
		{
			for (int j = v; j >= a[i].w; j--)
			{
				for (k1 = 1; k1 <= k; k1++)
				{
					b[k1] = dp[j][k1];                 //分别记录放与不放
					c[k1] = dp[j - a[i].w][k1] + a[i].v;
				}
				b[k1] = c[k1] = -1;
				x = y = z = 1;
				while (z <= k && (x <= k || y <= k))
				{
					if (b[x] > c[y]) dp[j][z] = b[x++];
					else dp[j][z] = c[y++];

					if (dp[j][z] != dp[j][z - 1]) z += 1;  //只要和上一个最优解不一样 那就进行下一个最优解计算
				}
			}
		}
		cout << dp[v][k] << endl;
	}
}