微变型的01背包问题
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 3e4 + 10, M = 30;
int v[N],w[N];
int f[N];
int n,m;
int main(){
scanf("%d%d",&m,&n);
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]] + v[i]*w[i]);
}
}
cout << f[m] << endl;
return 0;
}