算法.01背包（滚动数组）&&完全背包

#include<iostream>
using namespace std;//01背包
const int N = 10010;
int n, m;
int dp[N];
int w[N], v[N];
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> w[i] >>v[i];
    for (int i = 1; i <= n; i++)
    {
        for (int j = m; j >= w[i]; j--)
        {
            
             dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
        }
    }

    cout << dp[m];
}

#include<iostream>
using namespace std;
const int N = 10010;//完全背包
int n, m;
int dp[N];
int w[N], v[N];
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> w[i] >>v[i];
    for (int i = 1; i <= n; i++)
    {
        for (int j = w[i]; j <= m; j++)
        {
            
             dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
        }
    }

    cout << dp[m];
}

完全背包思维数学推导比较复杂