AcWing 3.完全背包问题

题目链接：https://www.acwing.com/problem/content/3/

博客链接：https://www.cnblogs.com/marswithme/p/16737193.html

---

 

放AC代码

#include<bits/stdc++.h>
using namespace std;
int n, m;
int v[1010], w[1010], dp[1010];

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i ++)
        cin >> v[i] >> w[i];
    for(int i = 1; i <= n; i ++)
        for(int j = v[i]; j <= m; j++)
            dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
    cout << dp[m];
    return 0;
}