Maximise Min Value

Problem Statement

Maximise Min Value Problem Description You are given two arrays, firstShop and secondShop, representing the prices of n items in two different shops. Your task is to select exactly k indices (same indices for both shops) such that the minimum total cost between the two shops for the selected items is as large as possible. Each item is associated with two costs: one from firstShop and one from secondShop. The selection must be consistent across both shops: If index i is selected, it contributes its cost from both arrays to the respective sums. Complete the function maximiseMinValue in the editor. The function is expected to return an INTEGER. The function accepts the following parameters: - INTEGER_ARRAY firstShop: the prices of items in the first shop - INTEGER_ARRAY secondShop: the prices of items in the second shop - INTEGER k: the number of items to choose The signature for the function is: int maximiseMinValue(vector firstShop, vector secondShop, int k) { } Returns int: the maximum