动态规划经典：01背包问题

题目：


#include<iostream>
#include<string.h>
using namespace std;
int temp[1005][1005];
int returnMax(int x, int y)
{
if (x >= y)
return x;
else
return y;
}
struct pack
{
int volu;
int value;
};
pack p[1005];
int main(){
int V, N;
while (cin >> N >> V, N, V)
{
memset(temp, 0, sizeof(temp));
for (int i = 0; i < N; i++)
{
cin >> p[i].volu >> p[i].value;
}
for (int i = p[0].volu; i <= V; i++)
{
temp[0][i] = p[0].value;
}
for (int i = 1; i <N; i++)
{
for (int j = 0; j <= V; j++)
{

temp[i][j] = temp[i - 1][j];
if (j - p[i].volu >= 0)
{
temp[i][j] = returnMax(temp[i - 1][j], temp[i - 1][j - p[i].volu] + p[i].value);
}

}
}
cout << temp[N - 1][V] << endl;

}
return 0;
}