From 97c217129e4acf5bd2599236a0c68f339beb8a14 Mon Sep 17 00:00:00 2001
From: chayan das <110921638+Chayandas07@users.noreply.github.com>
Date: Sun, 2 Mar 2025 22:43:34 +0530
Subject: [PATCH] Create 2570. Merge Two 2D Arrays by Summing Values

---
 2570. Merge Two 2D Arrays by Summing Values | 23 +++++++++++++++++++++
 1 file changed, 23 insertions(+)
 create mode 100644 2570. Merge Two 2D Arrays by Summing Values

diff --git a/2570. Merge Two 2D Arrays by Summing Values b/2570. Merge Two 2D Arrays by Summing Values
new file mode 100644
index 0000000..677d6b4
--- /dev/null
+++ b/2570. Merge Two 2D Arrays by Summing Values	
@@ -0,0 +1,23 @@
+class Solution {
+public:
+    vector<vector<int>> mergeArrays(vector<vector<int>>& nums1, vector<vector<int>>& nums2) {
+        vector<vector<int>>ans;
+        int i=0;
+        int j=0;
+        while(i<nums1.size() && j<nums2.size()){
+            if(nums1[i][0]<nums2[j][0])ans.push_back(nums1[i++]);
+            else if(nums1[i][0]>nums2[j][0])ans.push_back(nums2[j++]);
+            else if(nums1[i][0]==nums2[j][0]){
+                vector<int>temp;
+                temp.push_back(nums1[i][0]);
+                temp.push_back(nums1[i][1]+nums2[j][1]);
+                ans.push_back(temp);
+                i++;
+                j++;
+            }
+        }
+        while(i<nums1.size())ans.push_back(nums1[i++]);
+        while(j<nums2.size())ans.push_back(nums2[j++]);
+        return ans;
+    }
+};