最小的K个数

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