human
Minimize cost to convert given two integers to zero using given operations | Function to find out the minimum cost to make two number X and Y equal to zero.
If x is greater than y then swap.
Cost of making y equal to x.
Cost if we choose 1 st operation.
Cost if we choose 2 nd operation.
Total cost ;"
How can the above be solved in Python?
 ... Can you provide a code to minimize cost to convert given two integers to zero using given operations and the other steps required?
assistant
#Here is code to minimize cost to convert given two integers to zero using given operations and the other steps required.
 def makeZero ( x , y , a , b ) :
	if ( x > y ) :
		x , y = y , x
	tot_cost = ( y - x ) * a
	cost1 = 2 * x * a
	cost2 = x * b
	tot_cost += min ( cost1 , cost2 )
	print ( tot_cost )
/ * Driver code * /
if __name__ == " _ _ main _ _ " :
	X , Y = 1 , 3
	cost1 , cost2 = 391 , 555
	makeZero ( X , Y , cost1 , cost2 )