typedef struct
{
  int gno;
  int gv;
}Goods;
typedef struct node
{
  int gno;
  struct node *link;
}GNode;
typedef struct node1
{
  int remainder;
  GNode * head;
  struct node1 * next;
}GBox;

void GoodsSort(Goods goods[], int n)
{
  int i, j;
  Goods t;
  for (i = 0; i<n - 1; i++)
  {
    for (j = i + 1; j<n; j++)
    {
      if (goods[i].gv<goods[j].gv)
      {
        t = goods[i];
        goods[i] = goods[j];
        goods[j] = t;
      }
    }
  }
  for (i = 0; i<n; i++)
    printf("%d  %d\n", goods[i].gno, goods[i].gv);

GBox * GoodsBox(Goods goods[], int n)
{
  GNode *h = NULL, *pg, *t;
  GBox *hbox = NULL, *pb, *qb;
  int i;
  for (i = 0; i<n; i++)/////////////////遍歷貨物信息數(shù)組
  {
    pg = (GNode *)malloc(sizeof(GNode));///////////////分配貨物節(jié)點(diǎn)單元
    pg->gno = goods[i].gno;
    pg->link = NULL;//貨物節(jié)點(diǎn)初始化
    if (!hbox)//若一個(gè)箱子都沒有
    {
      hbox = (GBox *)malloc(sizeof(GBox));
      hbox->remainder = 10;
      hbox->head = NULL;
      hbox->next = NULL;
    }
    qb=pb = hbox;//都指向箱子頭
    while (pb)//找箱子
    {
      if (pb->remainder >= goods[i].gv)/////////////////////////////能裝下
        break;//找到箱子，跳出while
      else
      {
        qb = pb;
        pb = pb->next;//qb是前驅(qū)
      }
    }/////////////////////////////////////遍歷箱子結(jié)束
    if (pb==NULL)/////////////////////需要新箱子
    {
      pb = (GBox *)malloc(sizeof(GBox));//分配箱子
      pb->head = NULL;
      pb->next = NULL;
      pb->remainder = 10;//初始體積
      qb->next = pb;//前驅(qū)指上
    }
    if (!pb->head)//如果箱子里沒貨
    {
      pb->head = pg;
      t = pb->head;
    }
    else
    {
      t = pb->head;
      while (t->link) t = t->link;//貨尾 尾插
      t->link = pg;
    }
    pb->remainder -= goods[i].gv;
      ////////////////////////////////////裝箱
  }
  return hbox;