题解 | #最小的K个数#

class Solution {
public:
    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        vector<int> count(10005,0);
        vector<int> res;
        for(auto i : input){
            count[i]++;
        }

        for(int i=0;k!=0 && i<count.size();i++){
            while(k!=0 && count[i]--){
                res.push_back(i);
                k--;
            }
        }

        return res;
    }
};