Transcribed Image Text: Max and Min are the only two delivery men of Domino’s Pizza. Assume the particular store received
N orders. If Max takes the ith order, he would be tipped A, dollars and if Min 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 maximised. But only one order will be handled by
only one person. Also, due to time constraints Max cannot take more than X orders and Min 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 Max or Min.
You have to develop a NODE JS code that print out the maximum possible amount of total tip money
after processing all the orders.
Sample Input:
533
74314
19507
Result:
29
Order an Essay Now & Get These Features For Free:
Turnitin Report
Formatting
Title Page
Citation
Outline
