Introduction - If you have any usage issues, please Google them yourself
The basic operation of the heap, insert delete the array into a heap of small roots, and check the heap for small roots, roots with a small heap sort in descending order by means of an array of size n sort.