标题：输入n个整数，找出其中的最小的k个数。
import heapq
def get_min_k(arry,k):
max_heap = []
l = len(arry)
if l<1 or k<1 or k>l:
return None
for arr in arry:
arr = -1*arr
if len(max_heap)<k:
heapq.heappush(max_heap,arr)
else:
heapq.heappushpop(max_heap,arr)
res = [-1*i for i in max_heap]
return res
import heapq
def get_mi
