Maximise Min Value

Problem Statement

Maximise Min Value Problem Two shops sell the same n items. Item i costs firstShop[i] in the first shop and secondShop[i] in the second. Choose **exactly k indices**, the same indices for both shops. The chosen set then has two totals: the sum of firstShop over those indices and the sum of secondShop over them. The value of the choice is the smaller of those two totals. Return the largest value any choice of exactly k indices can reach. Complete the function maximiseMinValue , which receives firstShop , secondShop and k and returns an integer. Input Format The first line contains the integer n , the size of firstShop . Each of the next n lines contains one integer, firstShop[i] . The next line contains the integer n again, the size of secondShop . Each of the next n lines contains one integer, secondShop[i] . The last line contains the integer k . Output Format Print a single integer: the maximum possible value of the smaller of the two sums. Constraints 1 <= n <= 50 1 <= firs