赫夫曼树啊。输入说明：多组数据，第一行为整数m，表示有几组数据，每组数据分为两行输入；第１行为ｎ的值，第２行为ｎ个整数，表示字符的出现频度。

输出说明：对每组数据输出一个整数，表示所构造哈夫曼树的带权路径长度（输出整数后换行）。

-Huffman tree ah. Input Descr iption: multiple sets of data, the first act integer m, which means that there are several sets of data, each line of input data into two　the value of n first act, the second act n integers, representing the character frequency of occurrence. Output Descr iption: For each data output an integer that represents the Huffman tree structure with the right path length (integer output after newline).