human
Maximize array sum after K negations | Set 1 | This function does k operations on array in a way that maximize the array sum . index -- > stores the index of current minimum element for j 'th operation.
Modify array K number of times.
Find minimum element in array for current operation and modify it i . e.
arr [ j ] -- > - arr [ j ].
this the condition if we find 0 as minimum element , so it will useless to replace 0 by - ( 0 ) for remaining operations.
Modify element of array.
Calculate sum of array.
Driver code"
Solution in Python:
assistant
#Here is code to maximize array sum after K negations and the other steps required.
 def maximumSum ( arr , n , k ) :
	for i in range ( 1 , k + 1 ) :
		min = + 2147483647
		index = - 1
		for j in range ( n ) :
			if ( arr [ j ] < min ) :
				min = arr [ j ]
				index = j
		if ( min == 0 ) :
			break
		arr [ index ] = - arr [ index ]
	sum = 0
	for i in range ( n ) :
		sum += arr [ i ]
	return sum
arr = [ - 2 , 0 , 5 , - 1 , 2 ]
k = 4
n = len ( arr )
print ( maximumSum ( arr , n , k ) )