完全背包 一位数组 完全体 模板

#include <bits/stdc++.h>
using namespace std;

const int N = 1005;

int dp[N];
int volume[N], val[N];

int main() 
{
   
#ifndef ONLINE_JUDGE
    freopen("D:/VS CODE/C++/in.txt", "r", stdin);
    freopen("D:/VS CODE/C++/out.txt", "w", stdout);
#endif

    int n, v;
    cin >> n >> v;

    for (int i = 1; i <= n; ++i) {
   
        scanf("%d %d", &volume[i], &val[i]);
    }

    for (int i = 1; i <= n; ++i) {
   
        for (int j = volume[i]; j <= v; ++j) {
   
            dp[j] = max(dp[j], dp[j - volume[i]] + val[i]);
        }
    }
    
    printf("%d", dp[v]);

    fclose(stdin);
    fclose(stdout);
    return 0;
}