题目链接:https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof/
题目如下:
class Solution {
public:
vector<int> getLeastNumbers(vector<int>& arr, int k) {
priority_queue<int> que;//默认为大根堆
vector<int> result(k);
for(int i=0;i<arr.size();i++){
que.push(-arr[i]);//使其变为小根堆
}
for(int i=0;i<k;i++){
result[i]=-que.top();
que.pop();
}
return result;
}
};