01背包

未优化代码：

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 10010;
int f[N][N], v[N], w[N];
int n, m;
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 = 1; 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] << endl;
}