def issort_list(list1):
    
    result = all(list1[i] <= list1[i+1] for i in range(len(list1)-1))
    return result
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums