Multi Dimensional Selection

Given a 2-d array arr of size n x m, a selection is defined as an array of integers such that it contains at least [m/2] integers from each row of arr. The cost of the selection is defined as the maximum difference between any two integers of the selection.

Suppose k is the minimum cost of all the possible selections for the given 2-d array. Find the maximum value of the product of k * the number of integers considered in the selection with the minimum cost.

Function Description
Complete the function getMaxProduct in the editor below.

getMaxProduct has the following parameter:
int arr[n][m]: the given 2-d array

Returns
int: the maximum possible product

Example and Constraints