题解 | #最小的K个数#

#include <queue>
#include <vector>
class Solution {
public:

    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        priority_queue<int, vector<int>> que;
        for (auto num : input){
            que.push(num);
            while (que.size() > k){
                que.pop();
            }
        }
        vector<int> result;
        while (!que.empty()){
            result.push_back(que.top());
            que.pop();
        }
        return result;
    }
};