def maximum_value(test_list):
  
  res = [(key, max(lst)) for key, lst in test_list]
  return (res) 
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums