最少费用购物问题 算法设计

#include <iostream> 
#include <map> 
using namespace std; 

const int N = 10; 
const int M = 1005; 
int cost[N][N][N][N][N]; 
struct node 
{ 
    int c, k, p; 
}product[N]; 
int p[N]; 
int offer[M][N]; 
int n, m; 

void minicost() 
{ 
    int a,b,c,d,e,pp, minm; 
    minm = 0; 
    for (int i=1; i <= n; i++) 
        minm += p[i] * product[i].p; 
    for (pp=1; pp<=m; pp++) 
    { 
        a = p[1] - offer[pp][1]; 
        b = p[2] - offer[pp][2]; 
        c = p[3] - offer[pp][3]; 
        d = p[4] - offer[pp][4]; 
        e = p[5] - offer[pp][5]; 
        if (a >=0 && b>=0 && c>=0 && d>=0 && e >=0 && cost[a][b][c][d][e]+offer[pp][0] < minm) 
            minm = cost[a][b][c][d][e]+ offer[pp][0];