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 Bi 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 python code that print out the maximum possible amount of total tip money after processing all the orders. Sample Input: 533 74314 19507 Result: 29

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

cse

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 Aj 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 python code that print out the maximum possible amount of total tip money
after processing all the orders.
Sample Input:
533
74314
19507
Result:
29
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 Aj 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 python code that print out the maximum possible amount of total tip money after processing all the orders. Sample Input: 533 74314 19507 Result: 29
Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY