def round_num(n,m):
    
    a = (n //m) * m
    b = a + m
    return (b if n - a > b - n else a)
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums