def return_sum(dict):
  
  sum = 0
  for i in dict.values():
    sum = sum + i
  return sum
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums