题解 | #小根堆直接输出——最小的K个数#

/*
将所有元素输入小根堆，输出小根堆的前k个结点即为答案
*/
#include <vector>
class Solution {
public:
    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        vector<int> res;
        priority_queue<int, vector<int>, greater<int>> q;
        if(k==0 || input.size() == 0) return res;
        for(int i=0;i<input.size();i++) q.push(input[i]);
        for(int j=0;j<k;j++){
            res.push_back(q.top());
            q.pop();
        }
        return res;
    }
};