构建一个容量为k的大根堆，依次读取int数据，若大根堆已满，则比较读取的元素是否小于堆顶最大元素，是则先将最大元素删除，再将新元素压入。若大根堆未满，则直接将读取的元素

压入大根堆。在将n个元素依次判断比较处理完之后，即得到n个数据中最小的k个数据。将其从堆顶依次弹出，即将最小的k个元素从大到小输出。-Building a capacity of large root heap k sequentially read int data elements if a large root heap is full, then compare whether the read element is less than the maximum stack top, is the largest element first deleted, and then pressed into a new element. If large root heap element is not full, direct read

Pressed into large root heap. In the n elements in order to determine the comparison process after completion, to obtain n data smallest k data. Which in turn is popped　the top of the heap, is about the smallest k elements in descending output.