sicily 1342 开心的金明 (动规)

刷一下简单的背包问题

以下为代码：

//1342. 开心的金明
#include <iostream>
using namespace std;

#define MAX(a,b) a>b?a:b

int backpack(int w[], int v[], int n, int c)
{
    //w表示重要度
    //v表示价格
    //c表示价格总量
    int max[n+1][c+1];
    for (int j = 0; j <= c; j++)
    {
        if (j<v[1]) max[1][j] = 0;
        else max[1][j] = w[1]*v[1];
    }
    for (int i = 2; i <= n; i++)
    {
        for (int j = 0; j <= c; j++)
        {
            if (j < v[i]) max[i][j] = max[i-1][j];
            else max[i][j] = MAX(max[i-1][j], (max[i-1][j-v[i]]+v[i]*w[i]));
        }
    }
    return max[n][c];
}

int main()
{
    int c, n;
    while (cin>>c>>n)
    {
        int w[n+1], v[n+1];
        for (int i = 1; i <= n; i++) cin>>v[i]>>w[i];
        cout<<backpack(w,v,n,c)<<endl;
    }
    return 0;
}