C++ Program for Find k pairs with Smallest Sums in Two ArraysProvided 2 ascending integer arrays arr1[] and arr2[] and an integer k. Determine k pairs with the smallest sums, where one element belongs to arr1[] and the other element belongs to arr2[]. Examples: Method No. 1 (Simple)Find all of the pairs and record their sums. This step's time complexity is O(n1 * n2), where n1 and n2 are the sizes of the input arrays. Then sort the pairs by sum. This step's time complexity is O(n1 * n2 * log (n1 * n2)).
Method 2 (Potent):Starting with the smallest sum pair, we discover k smallest sum pairings one by one. The aim is to keep track of all array2[] elements that have already been investigated for each element array1[i1], so that in an iteration we just consider the next element. We utilise an index array indexno2[] to maintain the indexes of the following elements in the other array for this purpose. It simply indicates which element of the second array should be added to the element of the first array in each iteration. For the element that forms the next minimum value pair, we increment the value in the index array. Implementation in C++: Output: (1, 2) (1, 4) (3, 2) (3, 4)
Method 3: Sorting, Min heap, and MapInstead of brute forcing our way through all of the available sum combinations, we should develop a strategy to narrow our search space down to possible candidate sum combinations.
Implementation in C++: Output: (1, 2) (1, 4) (1, 5) (1, 9)
