模板题
#include<iostream>
using namespace std;
int n,m;
int v[30];
int w[30];
int dp[30][30050];//第几个,剩余零花钱
int main(){
cin >> n >> m;
int i,j;
for(i = 1; i <= m; ++i){
cin >> v[i] >> w[i];
}
for(i=1; i <= m; ++i){
for(j = 1; j <= n ;++j){
if(v[i] > j)dp[i][j] = dp[i-1][j];
else{
dp[i][j] = max(dp[i-1][j],dp[i-1][j-v[i]]+v[i]*w[i]);
}
}
}
cout << dp[m][n];
return 0;
}