Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.
 
Please complete the following python code precisely:
```python
class Solution:
    def arrayPairSum(self, nums: List[int]) -> int:
```