NYOJ 289 (0-1背包)

#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

const int MAXN = 1010;

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

int dp[MAXN];
int V;

void Zero_One_Pack(int cost, int Price)
{
for(int v = V; v >= cost; --v)
dp[v] = MAX(dp[v], dp[v - cost] + Price);
}

int main()
{
int n;
int cost, price;
while(~scanf("%d %d", &n, &V) && n && V)
{
memset(dp, 0, sizeof(dp));
for(int i = 1; i <= n; ++i)
{
scanf("%d %d", &cost, &price);
Zero_One_Pack(cost, price);
}
cout<<dp[V]<<endl;
}
return 0;
}