POJ 3624 01背包问题

/*
* 纯粹的 01 背包问题！
* Accepted 204 K  360 ms
*/
#include<iostream>
using namespace std;

int * w, *v;
int n;
int max_w;   // 最大允许的重量
int * dp;

inline int max(int a, int b){
	return (a > b) ? a : b;
}

int dp_01_bag(int * w, int * v, int n, int max_w)
{
	dp = new int[max_w + 1];
	memset(dp, 0, sizeof(int)*(max_w + 1));

	for (int i = 1; i <= n;i++)
	for (int j = max_w; j >= 1; j--) 
	{
		if (j - w[i] >= 0)
			dp[j] = max( dp[j], dp[j - w[i]] + v[i] );

	}
	return dp[max_w];
}

int main(int argc, char * argv[])
{
	// input
	scanf("%d%d", &n, &max_w);
	w = new int[n+1];
	v = new int[n+1];
	for (int i = 1; i <= n; i++)
	{
		scanf("%d%d", &w[i], &v[i]);
	}

	// process
	int rs = dp_01_bag(w, v, n, max_w);

	// output
	printf("%d", rs);

	return 0;
}