
    Given a list of estimated delivery times for different route segments during peak traffic hours, determine the sequence of segments that would result in the most time-efficient delivery route by arranging these time estimates to form the largest possible number. The delivery times are provided as single-digit standardized time units, and the goal is to optimize the route by finding the arrangement that yields the maximum numerical value when these digits are combined.
    

    
def find_Max_Num(arr):
    """
    Given a list of estimated delivery times for different route segments during peak traffic hours, determine the sequence of segments that would result in the most time-efficient delivery route by arranging these time estimates to form the largest possible number. The delivery times are provided as single-digit standardized time units, and the goal is to optimize the route by finding the arrangement that yields the maximum numerical value when these digits are combined.
    

    """
def find_Max_Num(arr):
    """
    Given a list of estimated delivery times for different route segments during peak traffic hours, determine the sequence of segments that would result in the most time-efficient delivery route by arranging these time estimates to form the largest possible number. The delivery times are provided as single-digit standardized time units, and the goal is to optimize the route by finding the arrangement that yields the maximum numerical value when these digits are combined.
    

    """
    n = len(arr)
    arr.sort(reverse=True)
    num = arr[0]
    for i in range(1, n):
        num = num * 10 + arr[i]
    return num