最小的k个数

class Solution {
public:
    vector<int> GetLeastNumbers_Solution(vector<int> arr, int k) {
        vector<int> mini; 
        if(arr.size()<k) return mini;
        for(int i = 0; i < k; i++){
        for(int j = i + 1; j <arr.size() ; j++) if(arr[j] < arr[i]) swap(arr[j], arr[i]);
        mini.push_back(arr[i]);
    } return mini;   
    }
};