K largest and smallest elements in python

k_largest.py

import heapq
def k_largest(arr,k):
  h= []
  heapq.heapify(h)
  for i in arr:
    heapq.heappush(h,i)
    if len(h) > k :
      heapq.heappop(h)
  result = []
  while h:
    result.insert(0,heapq.heappop(h))
  return result
if __name__=="k_largest":
  print(k_largest([5,6,7,1,2,3,4,100,200,400,1234,0,0,12,123,100000], 3))

k_smallest.py

def k_smallest(arr,k):
  h= []
  heapq.heapify(h)
  for i in arr:
    heapq.heappush(h,-i)
    if len(h) > k :
      -heapq.heappop(h)
  result = []
  while h:
    result.append(heapq.heappop(h))
  return result

if __name__=="k_smallest":
  print(k_smallest([5,6,7,1,2,3,4,100,200,400,1234,0,0,12,123,100000], 3))