最小的K个数

public class Solution {

    public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
        ArrayList<Integer> ret = new ArrayList<>();
        if(k > input.length) return ret;
        PriorityQueue<Integer> minHeap = new PriorityQueue<>();
        for(int i=0; i<input.length; i++){
            minHeap.offer(input[i]);    
        }
        while(k>0){
            ret.add(minHeap.poll());    
            k--;
        }
        return ret;
    }
}