给定若干个字符及其对应的权重，建造一颗高度尽可能小的Huffman树及字符的Huffman编码。-given a number of characters and their corresponding weights, construction of a high as possible Huffman tree and the character of Huffman coding.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001271s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.090960s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001414s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001934s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001216s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003671s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000998s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003255s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015334s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001348s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 267889 [ RunTime:0.001428s ]
