Create 3507. Minimum Pair Removal to Sort Array I (#987)

Author: Chayandas07

3507. Minimum Pair Removal to Sort Array I

@@ -0,0 +1,31 @@
+class Solution {
+public:
+    int minimumPairRemoval(vector<int>& nums) {
+        int operations = 0;
+
+        while (!isNonDecreasing(nums)) {
+            int minSum = nums[0] + nums[1];
+            int index = 0;
+
+            for (int i = 1; i < nums.size() - 1; i++) {
+                int sum = nums[i] + nums[i + 1];
+                if (sum < minSum) {
+                    minSum = sum;
+                    index = i;
+                }
+            }
+
+            nums[index] = minSum;
+            nums.erase(nums.begin() + index + 1);
+            operations++;
+        }
+        return operations;
+    }
+
+    bool isNonDecreasing(vector<int>& nums) {
+        for (int i = 1; i < nums.size(); i++) {
+            if (nums[i] < nums[i - 1]) return false;
+        }
+        return true;
+    }
+};