def sum_list(lst1,lst2):
  
  res_list = [lst1[i] + lst2[i] for i in range(len(lst1))] 
  return res_list
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums