题解 | #最小的K个数#

#include <functional>
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> ret;
        priority_queue<int, vector<int>, greater<int>> que;
        for (auto num : input) {
            que.push(num);
        }
        int i = 0;
        while (i < k && !que.empty()) {
            int tmp = que.top();
            ret.push_back(tmp);
            que.pop();
            i++;
        }
        return ret;
    }
};