01背包问题

#include<bits/stdc++.h>
#define MAX_N 100
#define MAX_W 1000000
using namespace std;
int n, W;               //W为背包容量
int w[MAX_N], v[MAX_N];
int dp[MAX_W];

void solve()
{
    for (int i = 0; i < n; i++)
    {
        for (int j = W; j >= 0; j--)  //倒着来，才能保证数据不被影响
        {
            if (j < w[i])
            {
                dp[j] = dp[j];
            }
            else
            {
                dp[j] = max(dp[j], dp[j-w[i]] + v[i]);
            }
        }
    }
    printf("%d\n", dp[W]);
}
int main()
{
    scanf("%d%d", &n, &W);
    for (int i = 0; i < n; i++)
    {
        scanf("%d%d", w+i, v+i);
    }
    solve();
    return 0;
}