文件名称:HuffmanCode
介绍说明－－下载内容均来自于网络，请自行研究使用
现在有篇文章，请用二进制前缀编码对文章中出现所有字符进行其编码，使编码后的文章总长最短。
多组输入，第一个正整数T表示组数。
每组第一行有一个正整数n，1≤n≤100000表示所用的字符种数。
接下来一行为n个正整数，表示每个字符在文章中出现的次数。
输出编码的最小长度-There are articles, please use the binary prefix code for the article appeared in the encoding of all characters, so that the encoded length of the shortest articles. Multiple input, the first positive integer T that group number. The first line in each group there is a positive integer n, 1 ≤ n ≤ 100000 characters used in that species. Then a positive integer n an act, that each character appears in the article the number of times. The minimum length of the output encoding
多组输入，第一个正整数T表示组数。
每组第一行有一个正整数n，1≤n≤100000表示所用的字符种数。
接下来一行为n个正整数，表示每个字符在文章中出现的次数。
输出编码的最小长度-There are articles, please use the binary prefix code for the article appeared in the encoding of all characters, so that the encoded length of the shortest articles. Multiple input, the first positive integer T that group number. The first line in each group there is a positive integer n, 1 ≤ n ≤ 100000 characters used in that species. Then a positive integer n an act, that each character appears in the article the number of times. The minimum length of the output encoding
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1289_Huffman Code .c