剑指offer-最小的k个数

class Solution {
public:
    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        vector<int> result;
        int len = input.size();
        if(len==0 || k>len)
            return result;
        sort(input.begin(),input.end());
        result.assign(input.begin(), input.begin()+k);
        return result;
    }
};