Array Find K Pairs with Smallest Sum Java Solution Problem Statement Given two integer arrays, arr1 and arr2, find K pairs of elements such that (x,y) where x is the value from the first array and y is the value from the second array who sum is the smallest. For example, give