01背包问题
f[i][j] = max(f[i-1][j], f[i-1][j-v]+w)
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110, M = 1010;
int n, m;
int f[M];
int main(){
cin>>m>>n;
for(int i = 1; i <= n; i++){
int v,w;
cin>>v>>w;
for(int j = m; j >= v; j--){
f[j] = max(f[j], f[j-v] + w);
}
}
cout<<f[m]<<endl;
return 0;
}