题解 | #最小的K个数#

class Solution {
public:
    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        if(k == 0) return {};
        sort(input.begin(),input.end()); //用优先队列可以满足时间复杂度要求
        vector<int> res;
        for(int i=0;i<k;i++) res.push_back(input[i]);
        return res;
    }
};