class Solution {
public int minPairSum(int[] nums) {
Arrays.sort(nums);
int[] storage = new int[nums.length/2+10];
int left = 0, right = nums.length-1;
int ans =0;
while(right>left){
storage[left] = nums[left++]+nums[right--];
}
for(int i:storage){
ans = Math.max(ans, i);
}
return ans;
}
}
