PROGRAMMING:Huffman coding
This problem requires the Huffman coding of characters. Pay attention to the Huffman tree established in strict accordance with the order of left small and right next small, and Huffman coding in strict accordance with the left '0' and right '1'.
###Input format:
Input is the frequency of each character in the communication
###Output format:
The output is a Huffman code of each character, one line for each letter
###Input example:
```in
A:2
B:3
C:6
D:7
E:10
F:19
G:21
H:32
```
###Output example:
```out
A:10000
B:10001
C:1001
D:1010
E:1011
F:00
G:01
H:11
```
answer：If there is no answer, please comment
###Input format:
Input is the frequency of each character in the communication
###Output format:
The output is a Huffman code of each character, one line for each letter
###Input example:
```in
A:2
B:3
C:6
D:7
E:10
F:19
G:21
H:32
```
###Output example:
```out
A:10000
B:10001
C:1001
D:1010
E:1011
F:00
G:01
H:11
```
answer：If there is no answer, please comment