Solution 1 - Sort and Pair
After sorting, sum every even-indexed element (the min in each pair).
""" 0561.1 - Array Partition - Solution 1 - Sort and Pair """
class Solution:
def arrayPairSum(self, nums) -> int:
nums.sort()
return sum(nums[::2])
if __name__ == "__main__":
print(Solution().arrayPairSum([1, 4, 3, 2])) # 4