class Solution {
public:
vector<int> getLeastNumbers_Solution(vector<int> input, int k) {
sort(input.begin(),input.end());//排序
vector<int> res;
for(int i=0;i<k;i++) res.push_back(input[i]);//将最小的k个数存储到数组
return res;
}
};