please do it in c++ , and can you show me the Algorithm Design Idea

G:3 5. Huffman Tree and Huffman Code(Binary Tree) [Solution introduction: the H:11 fourth and fifth videos in 4.7] [Problem description] Given n characters with corresponding weights, output Huffman code of each Huffman code is: character. The upper bound of n is 30. A:0110 [Basic requirements and Example] Problem: Output Huffman code of each character. What you need to show in the terminal(the back part is outputted by you and the blue part is inputted by the user, i.e., teacher): Please input characters and weights: A:5 B:10 B:29 C:7 C:1110 D:8 D:1111 E:14 E:110 F:23 F:00 G:3 G:0111 H:11 H:010