题解 | #最小的K个数#

#include <queue>
#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param input int整型vector 
     * @param k int整型 
     * @return int整型vector
     */
    vector<int> GetLeastNumbers_Solution(vector<int>& input, int k) {
        // write code here
        vector<int> res;
        if (k == 0 || input.size() == 0) {
            return  res;
        }
        priority_queue<int> bigRootHeap;
        for (int i = 0; i < k; i++) {
            bigRootHeap.push(input[i]);
        }
        for (int i = k; i< input.size(); i++) {
            if (input[i] < bigRootHeap.top()) {
                bigRootHeap.pop();
                bigRootHeap.push(input[i]);
            }
        }
        while (!bigRootHeap.empty()) {
            res.push_back(bigRootHeap.top());
            bigRootHeap.pop();
        }
        return  res;
    }
};