动态规划 背包问题

include <iostream>
using namespace std;
int findM(int N, int K, int G[], int W[])
{
    int *M = new int[N + 1], i, j, k;
    for (i = 0; i<N + 1; i++)
        M[i] = 0;

    //遍历所有物品数
    for (i = 1; i<=K; i++)
    {
        //对总质量数大于物品质量进行遍历
        for (j = N; j >= G[i]; j--)
        {           
           M[j] = M[j]>W[i] + M[j - G[i]] ? M[j] : W[i] + M[j - G[i]];
        }
    }
    return M[N];
}
int main(){
    int N, K, i;
    while (cin >> N >> K)
    {
        int *G = new int[K+1];
        int *W = new int[K+1];
        G[0] = 0;
        W[0] = 0;
        for (i = 1; i<K+1; i++)
            cin >> G[i] >> W[i];
        cout << findM(N, K, G, W) << endl;
        delete[]G;
        delete[]W;
    }
    return 0;
}