多元Huffman编码变形

问题描述：

在一个操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定在合并过程中最多可以有m(k)次选k 堆石子合并成新的一堆，2≤k≤n，合并的费用为新的一堆的石子数。试设计一个算法，计算出将n 堆石子合并成一堆的最小总费用。数据输入：

由文件input.txt 提供输入数据。文件的第1 行有1 个正整数n，表示有n 堆石子。第2行有n个数，分别表示每堆石子的个数。第3行有n-1 个数，分别表示m(k)（2≤k≤n）的值。

-Deformation of multi-Huffman Encoding Descr iption: In a playground are placed around the rock n heap. Stone is to have the order to merge into a pile. The provisions of the merger process can have up to m (k) election k heap of stones into a pile of new, 2 ≤ k ≤ n, the combined cost of the stone pile of the new number. Try to design an algorithm to calculate the n heap a pile of stones into the smallest total cost. Data entry: input.txt documents provided by the input data. Line 1 of the document there is a positive integer n, that there are n piled stones. No. 2 there are n number of lines, respectively, said the number of stones in each pile. Line 3 has the number of n-1, respectively, m (k) (2 ≤ k ≤ n) values.