题目
1. 最大堆
2. priority_queue
3. vector
4. 答题
参考来源:https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof/solution/zui-xiao-de-kge-shu-by-leetcode-solution/
- 对原数组从小到大排序后取出前 k个数即可。
class Solution {
public:
vector<int> getLeastNumbers(vector<int>& arr, int k) {
vector<int> vec(k,