class Solution:
    def minPairSum(self, nums: List[int]) -> int:
        ans = []
        nums.sort()
        for i in range(int(len(nums)/2)):
            temp = nums[0] + nums[-1]
            ans.append(temp)
            nums.pop()
            nums.pop(0)
        return max(ans)