01背包

#include<iostream>
#include<algorithm>
using namespace std;


const int N = 1010;
// 体积 价值
int v[N], w[N];
// 状态
int f[N][N];

int main(){
    int n, m;
    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 = 0; j <= m; j ++){
            f[i][j] = f[i - 1][j];
            if(j >= v[i]){
                f[i][j] = max(f[i][j], f[i - 1][j - v[i]] + w[i]);
            }
        }
    }
    cout << f[n][m];
    return 0;
}

一维优化

#include<iostream>
#include<algorithm>
using namespace std;


const int N = 1010;
// 体积 价值
int v[N], w[N];
// 状态
int f[N];

int main(){
    int n, m;
    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 = m; j >= v[i]; j --){
            f[j] = max(f[j], f[j - v[i]] + w[i]);
        }
    }
    cout << f[m];
    return 0;
}