Find Max Minimum Value Using K Elements

Servicenow coding interview problem: Given two integer arrays Shop1 and Shop2 of equal size N and an integer K, choose K elements from each array. Compute the sums of the chosen K elements in each shop and return the maximum possible value of the minimum of these two sums. A concise interview question on arrays and selection from Servicenow interviews.