Find the closest pair from two arrays
Easy Accuracy: 46.05% Submissions: 789 Points: 2

Given two sorted arrays and a number x, find the pair whose sum is closest to x and the pair has an element from each array. In the case of multiple closest pairs return the smallest one.

Example 1:

Input : arr[ ] = {1, 4, 5, 7}
brr[ ] = {10, 20, 30, 40}
X = 32
Output : 1 30
Explanation:
The closest pair whose sum is closest
to 32 is {1, 30} = 31.


Example 2:

Input : arr[ ] = {1, 4, 5, 7}
brr[ ] = {10, 20, 30, 40}
X = 50
Output :  7 40 

This is a function problem. The input is already taken care of by the driver code. You only need to complete the function printClosest() that takes an array (arr), another array (brr), size of array arr (N), size of array brr (M), and return the array of two integers whose sum is closest to X. The driver code takes care of the printing.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(1).

Constraints:
1 ≤ N, M ≤ 105
1 ≤ A[i], B[i] ≤ 107

We are replacing the old Disqus forum with the new Discussions section given below.