装载问题

#include "cstdio"
#include "queue"
#define MAX 20   
#define INF 999
using namespace std;    

int n;  //集装箱数量
int w[MAX];  //集装箱的重量
int bestx[MAX];  //是否被装入第一艘船
int c;  //第一艘船的容量
int r[MAX];  //剩余载重

struct bnode
{
    struct bnode *parent;  //父结点
    int left;  //左孩子标志
};

struct heapNode
{
    struct bnode *b;  //指向活结点在子集树中的指针
    int level;  //结点在子集树中所在的层

    //从根结点到当前结点的路径所相应的载重量加上剩余集装箱重量之和
    int uweight;  //活结点优先级（上界），

    bool operator < (const heapNode &hn) const
    {
        return uweight < hn.uweight;
    }
};

//从根结点到当前结点的路径所相应的载重量加上剩余集装箱重量之和大的先出队列
priority_queue<heapNode> pq; 

void enHeap(int uw, bnode *parent, int isLeft, int i)  //入队列
{
    bnode *b = (bnode *)malloc(sizeof(bnode));
    b->parent = parent; 
    b->left = isLeft;
    heapNode hn;
    hn.level = i;
    hn.uweight = uw;
    hn.b = b;
    pq.push(hn);
}

void init(int n1, int c1, int weight[])
{
    n = n1;
    c = c1;
    int i;
    for(i=1; i<=n; i++)
        w[i] = weight[i];
    r[n] = 0;   //装入最后一个物品后，剩余载重为0
    for(i=n-1; i>0; i--)  
        r[i] = w[i+1] + r[i+1];
}

int maxLoading()
{ 
    bnode *e = NULL; //当前扩展结点
    heapNode hn;
    int i = 1;  //当前结点所在层
    int ew = 0;  //当前载重
    while(i!=n+1)  //还没有到叶结点时
    {
        if(ew+w[i]<=c)  //如果船还装得下当前的集装箱
            enHeap(ew+w[i]+r[i], e, 1, i+1);  //左子树
        enHeap(ew+r[i], e, 0, i+1);  //右子树

        hn = pq.top();  //取下一个扩展结点
        pq.pop();
        ew = hn.uweight - r[i];  //总载重-剩余载重=当前载重
        e = hn.b;   
        i = hn.level;
    }

    for(i=n; i>0; i--)  //从叶子结点到根节点构造最优解
    {
        bestx[i] = e->left;
        e = e->parent;
    }
    return ew;
}

int main()
{
    int n1 = 4;
    int c1 = 70;
    int weight[] = {0, 20, 10, 26, 15};
    init(n1, c1, weight);
    printf("船载重为：%d\n", c1);
    int sum = maxLoading();
    printf("集装箱重量为：\n");
    int i;
    for(i=1; i<=n; i++)
        printf("%d ", w[i]);
    printf("\n最优载重为：%d\n", sum);
    return 0;
}