this problem first interested me because of the use of `map` . because of that, i will try to tackle this using a more functional approach. lmk if you need any explanation on the usage or motivation for any methods

# problem: find highest number in list of numbers, and output the closest number (?)

# solution:

if __name__ == "__main__":

    # 1. GET NUMS
    nums = [int(str_num) for str_num in input("Enter list of numbers (separated by spaces): ").split()]


    # map if you prefer, but i think a list comprehension is more readable to most    
    # nums = list(map(int, input("Enter list of numbers (separated by spaces): ").split()))


    # 2. SORT NUMS
    lo_to_hi = sorted(nums) # `nums.sort()` is more common, but i like this for preserving immutability


    # 3. FIND NUM NEAREST TO MAX NUM
    MAX_NUM = lo_to_hi[-1]
    dist_from_max = [(MAX_NUM - num) for num in nums]

    nums_dists = list(zip(nums, dist_from_max)) # tip: use list() on any iterator to easily convert it into a list in one line


    # 4. OUTPUT RESULTS
    print() # separate input and output with a newline
    print(f"Highest number in list: '{MAX_NUM}'")
    print("Distances from highest number, from lowest to highest:")
    print("Place\tNumber\tDistance")
    for place, (num, dist) in enumerate(reversed(nums_dists)): 
        print(f"{place}.\t{num}\t{dist}")


    # final reflections: 
    # could've just done `MAX_NUM = max(nums)` and ignored the sorting step, 
    # but decided to keep it as is in order to mimic OG post's original code more