0-1背包 一维数组 模板

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

const int N = 1005;

int dp[N];
int val[N], weight[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", &weight[i], &val[i]);
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = v; j >= 0; --j) {
            if (j - weight[i] >= 0) {
                dp[j] = max(dp[j], dp[j - weight[i]] + val[i]);
            }
        }
    }

    printf("%d", dp[v]);

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