【问题描述】已知输入一串正整数，正整数之间用空格键分开，请建立一个哈夫曼树，以输入的数字为叶节点，求这棵哈夫曼树的带权路径长度。





【输入形式】首先输入正整数的个数，然后接下来为接下来的正整数，正整数个数不超过10个





【输出形式】输出相应的权值

-[Problem Descr iption] known input string of positive integers, positive integers separated by a space key, create a Huffman tree to enter the number of leaf nodes, find the right tree Huffman tree with path length . [Form] enter the number of first enter a positive integer, then the next for the next positive integer, the number of positive integers up to 10 outputs in the form [] output corresponding weight