最小K个数

题意

题目链接

思路

代码

class Solution {
public:
    vector smallestK(vector& arr, int k) {
        priority_queue Q;
        for (auto &index:arr)
        {
            Q.push(index);
            if (Q.size() > k)
                Q.pop();
        }
        vector ans;
        while (!Q.empty())
        {
            ans.push_back(Q.top());
            Q.pop();
        }
        return ans;
    }
};