简单的01背包问题
点击查看代码
#include<bits/stdc++.h>
using namespace std;
int f[30005];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int v, p;
cin >> v >> p;
for (int j = n; j >= v; j--) {
f[j] = max(f[j], f[j - v] + v * p);
}
}
cout << f[n];
return 0;
}