说明：  集装箱的装箱问题 给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装箱的空间利用率最高？ 本程序要求用贪心算法解决: 贪心算法总是作出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，它所做出的仅是在某种意义上的局部最优解。
(Container packing problem given a container, and its length L, width W and height H, the current batch of cylindrical timber, each timber are of a long L, but the radius is different from the first i set the root radius of timber ri. Asked how the packing, making maximum utilization of container space? This procedure requires greedy algorithm solution: greedy algorithm is always made in the current appears to be the best option. In other words, do not be optimal from an overall consideration, it made sense only in a local optimal solution.)