1267：【例9.11】01背包问题

#include<bits/stdc++.h>
using namespace std;
#define N 35
#define M 250
int dp[N][M], w[N], c[N];
int main()
{
    int m, n;
    cin >> m >> n;
    for(int i = 1; i <= n; ++i)
        cin >> w[i] >> c[i];
    for(int i = 1; i <= n; ++i)
        for(int j = 0; j <= m; ++j)
        {
            if(j >= w[i])
                dp[i][j] = max(dp[i-1][j], dp[i-1][j-w[i]]+c[i]);
            else
                dp[i][j] = dp[i-1][j];
        }
    cout << dp[n][m];
    return 0;
}