leetcode_1877

Author: KeremTAN

1877_Minimize_Maximum_Pair_Sum_in_Array.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int minPairSum(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        int i=-1, j=nums.size(), ret=0;
+        while(i<j){
+            if(ret<nums[++i]+nums[--j])
+                ret=nums[i]+nums[j];
+        }
+        return ret;
+    }
+};