剑指offer--最小的K个数

class Solution {
public:
    void heapSort(vector<int> &input, int start, int end){
        for(int i = end-1; i > start; --i ) {
            int j = (i + start - 1)/2; 
            if(input[j] > input[i]){
                int tmp = input[i]; 
                input[i] = input[j]; 
                input[j] = tmp; 
            }
        }
    }
    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        vector<int> ans; 
        if(k > input.size()){
            return ans; 
        }
        for(int i=0; i<k; ++i){
            heapSort(input, i, input.size()); 
            ans.push_back(input[i]); 
        }
        return ans; 
    }
};