Minimize Maximum Pair Sum in Array

class Solution {
public:
    int minPairSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int ans = 0;
        int N = (int)nums.size();
        for(int i = 0; i < N; ++i) {
            ans = max(ans, nums[i] + nums[N - 1 - i]);
        }
        return ans;
    }
};