Introduction - If you have any usage issues, please Google them yourself
Deformation of multi-Huffman Encoding Description: 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.