Given two sorted arrays of distinct integers, **A** and **B**, and an integer **C**,

find and return the pair whose sum is closest to **C** and the pair has one element from each array.

More formally, find A[i] and B[j] such that abs((A[i] + B[j]) - C) has minimum value.

If there are multiple solutions find the one with minimum **i** and even if there are multiple values of **j**

for the same **i** then return the one with minimum **j**.

**Note:** Return an array with two elements **{A[i], B[j]}**.

**Input Format**

```
The first argument given is the integer array A.
The second argument given is the integer array B.
The third argument given is integer C.
```

**Output Format**

```
Return the pair which has sum closest to C.
```

**Constraints**

```
1 <= length of both the arrays <= 100000
1 <= A[i], B[i] <= 10^9
1 <= C <= 10^9
```

**For Example**

```
Input 1:
A = [1, 2, 3, 4, 5]
B = [2, 4, 6, 8]
C = 9
Output 1:
[1, 8]
Input 2:
A = [5, 10, 20]
B = [1, 2, 30]
C = 13
Output 2:
[10, 2]
```

NOTE:You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.

Sign Up

to access hints and editorial solutions for**Find the closest pair from two sorted arrays**

to access hints and editorial solutions for

Loading...