01背包
#include<bits/stdc++.h>
using namespace std;
int f[1001];
int n, m;
int main () {
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) {
int v, w;
cin >> w >> v;
for (int j = m; j >= w; j -- )
f[j] = max (f[j], f[j - w] + v);
}
cout << f[m] << endl;
return 0;
}
完全背包
#include<bits/stdc++.h>
using namespace std;
int f[1001];
int n, m;
int main () {
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) {
int v, w;
cin >> w >> v;
for (int j = w; j <= m; j ++ )
f[j] = max (f[j], f