题解 | #最小的K个数#

public:
    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        vector<int> result;
        sort(input.begin(),input.end());
        int i,count=0;
        for(i=0;i<=input.size()-1;i++){
            if(count==k){
                break;
            }
            result.push_back(input[i]);
            count+=1;
        }
        return result;
    }
};