题意
题目链接
思路
代码
class Solution {
public:
vector<int> smallestK(vector<int>& arr, int k) {
priority_queue<int> Q;
for (auto &index:arr)
{
Q.push(index);
if (Q.size() > k)
Q.pop();
}
vector<int> ans;
while (!Q.empty())
{
ans.push_back(Q.top());
Q.pop();
}
return ans;
}
};