箱子最优分配——有n个集装箱要装上1艘载重量分别为c的轮船，其中第i个集装箱的重量为wi。最优装载问题要求确定在装载体积不受限制的情况下，将尽可能多的集装箱装上轮船，并找出一种装载方案



输入-Box optimal allocation- there are n containers to be loaded on a ship load of c, respectively, where the i-th container weight wi. Required to determine the optimal loading problem in the case of unrestricted loading volume, as many containers loaded on ships, and to find a loading program input