class Solution {
public:
vector<int> smallestK(vector<int>& arr, int k) {
if (arr.size()==0 || k==0) return {};
vector<int> ans;
sort(arr.begin(), arr.end());
for (int i=0; i<k;i++)
{
ans.push_back(arr[i]);
}
return ans;
}
};
快排: