<doocs>1877.Minimize Maximum Pair Sum in Array_1.py
def minPairSum( nums: List[int]) -> int:
    nums.sort()
    res, n = 0, len(nums)
    for i in range(n >> 1):
        res = max(res, nums[i] + nums[n - i - 1])
    return res
def sample_funcname ( var_0 : List [ int ] ) -> int :
    var_0.sort ( )
    var_5 , var_7 = 0 , len ( var_0 )
    for var_10 in range ( var_7 >> 1 ) :
        var_5 = max ( var_5 , var_0 [ var_10 ] + var_0 [ var_7 - var_10 - 1 ] )
    return var_5
