leetcode

0 class Solution {

1 public:

2 int minPairSum(vector<int> &nums) {

3 sort(nums.begin(), nums.end());

4 int res = INT_MIN, i = 0, j = nums.size() - 1;

5 while (i < j)

6 res = max(res, nums[i++] + nums[j--]);

7 return res;

8 }

9 };