python内置库heapq

class Solution(object):
    def getLeastNumbers_Solution(self, input, k):
        """
        :type input: list[int]
        :type k: int
        :rtype: list[int]
        """
        import heapq
        heap = []
        for i in input:
            heapq.heappush(heap, i)
        return heapq.nsmallest(k, heap)