text: #include <bits/stdc++.h>
  
  
  using namespace std;
  
  
  class Solution {
  public:
      int minPairSum(vector<int>& nums) {
          sort(nums.begin(), nums.end());
  
          int ans;
  
          ans = 0;
  
          for (int i = 0; i < nums.size() / 2; i++) {
              ans = max(ans, nums[i] + nums[nums.size() - 1 - i]);
          }
  
          return ans;
      }
  };