題意

題目鏈接

思路

代碼

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;}
};