完全背包问题

3. 完全背包问题 - AcWing题库 

#include <bits/stdc++.h>
#define bug cout << "***************" << endl
#define fuck(x) cout << #x << " -> " << x << endl
#define rep(i, num, e) for (int i = (num); i <= (e); i++)
#define dep(i, num, e) for (int i = (num); i >= (e); i--)
#define endl '\n'
#define int long long
using namespace std;
constexpr int N = 1e6 + 10, inf = 0x3f3f3f3f;
int a[N];
int v[N], w[N];
int dp[N];
void solve()
{
    int n, m;
    cin >> n >> m;
    rep(i, 1, n) cin >> v[i] >> w[i];
    rep(i, 1, n)
    {
        for (int j = v[i]; j <= m; j++) // 只有大于等于v[i]才可以装得下，从这里开始枚举;j的最大值是m
        {
            dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
        }
    }
    cout << dp[m] << endl;
}

signed main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T = 1;
    while (T--)
    {
        solve();
    }
    return 0;
}