Assume we have two arranged exhibits and a number x, we need to discover the pair whose total is nearest to x. Also, the pair has a component from each cluster. We have two exhibits A1 [0..m-1] and A2 [0..n-1], and another worth x. We need to discove...

posted
May 20
amna
112,545 points