human
Minimum sum of product of elements of pairs of the given array | Function to find the minimum product.
Sort the array using STL sort ( ) function.
Initialise product to 1.
Find product of sum of all pairs.
Return the product.
Driver code.
Function call to find product"
How can the above be solved in Python?
 Write me a code to minimum sum of product of elements of pairs of the given array and the other steps required?
assistant
#Here is code to minimum sum of product of elements of pairs of the given array and the other steps required.
 def minimumProduct ( arr , n ) :
	arr = sorted ( arr )
	product = 1
	for i in range ( 0 , n , 2 ) :
		product *= ( arr [ i ] + arr [ i + 1 ] )
	return product
arr = [ 1 , 6 , 3 , 1 , 7 , 8 ]
n = len ( arr )
print ( minimumProduct ( arr , n ) )