Tom and Ron are the only two delivery men of Domino's Pizza. Assume the particular store received N orders. If Tom takes the it orders, he would be tipped A, dollars and if Ron takes this order, the...

Extracted text: Tom and Ron are the only two delivery men of Domino's Pizza. Assume the particular store received N orders. If Tom takes the it orders, he would be tipped A, dollars and if Ron takes this order, the tip would be B, dollars. As they are best friend so they planned that they would distribute the orders among themselves so that the total tip money is maximized. But only one order will be handled by only one person. Also, due to time constraints Tom cannot take more than X orders and Ron cannot take more than Y orders. It is guaranteed that X + Y is greater than or equal to N, which means that all the orders can be handled by either Tom or Ron. You have to develop a C++ code that print out the maximum possible amount of total tip money after processing all the orders. Input 533 74314 19507 Output 29