说明：  简易学生信息管理系统 程序实现思路： 先创建一个学生元素类，用于存放学生的各种数据。然后创建一个堆(heap)类，把数据以堆的形式存储，可便进行堆排序及各种操作。最后再用一个类(class priQueue)包装了heap类，以方便主函数调用。本程序中比较核心的技术就是用到了堆排序，将学生按优先级（高的排前面，低的排后面）的大小进行有序排列。堆排序的时间复杂度较一般排序（如：冒泡，选择等）来得低，可使程序显示数据时效率更高。
(Simple Student Information Management System program ideas: the first element to create a student class, students used to store various data. And then create a stack (heap) type, the data in order to stack the form of storage, can be carried out and various operation HEAPSORT. Finally, re-use a class (class priQueue) type of packaging the heap in order to facilitate the main function call. Comparison of this procedure is the core technology used in the heap sort students by priority (high in front of the row, low row behind) the size of orderly arrangement. HEAPSORT time complexity of a more general sort (eg: bubble, choose, etc.) too low, the procedure can show the data more efficient.)