Donna likes to shop online. The main reason is that she gets a lot of offer! There are M online shops from where she purchases her items. The prices of the same item vary in both the shops. She needs to buy N items in all. And each she can buy each item in any one of the shops. All the shops offer certain offer. If she buys the * item in one shop, she gets a offer coupon for the i+1th item in the same shop. But if she purchases the i+1th item from a different shop, she cannot use the offer coupon. For example, if she buys the h item in Shop j and gets a offer of X pounds. Let the price of i+1th item be Y pounds in shop jand Z pounds in shop k. If she purchases the i+1th item from shop j she can use the offer coupon and hence, will have to pay Y- X pounds. If she purchases the i+1th item from shop k she cannot use the offer coupon and hence, will have to pay Z pounds. Note: If the offer given is more than price of the item in the shop, i.e. if Y-X < 0, the item is given free but she does NOT get any money back. Donna wants to spend as less as possible and wants your help. She starts buying from item 1 and goes on till item N in that order. Your task is simple. Tell her the least amount to spend to get all the N items.
Donna likes to shop online. The main reason is that she gets a lot of offer! There are M online shops from where she purchases her items. The prices of the same item vary in both the shops. She needs to buy N items in all. And each she can buy each item in any one of the shops. All the shops offer certain offer. If she buys the * item in one shop, she gets a offer coupon for the i+1th item in the same shop. But if she purchases the i+1th item from a different shop, she cannot use the offer coupon. For example, if she buys the h item in Shop j and gets a offer of X pounds. Let the price of i+1th item be Y pounds in shop jand Z pounds in shop k. If she purchases the i+1th item from shop j she can use the offer coupon and hence, will have to pay Y- X pounds. If she purchases the i+1th item from shop k she cannot use the offer coupon and hence, will have to pay Z pounds. Note: If the offer given is more than price of the item in the shop, i.e. if Y-X < 0, the item is given free but she does NOT get any money back. Donna wants to spend as less as possible and wants your help. She starts buying from item 1 and goes on till item N in that order. Your task is simple. Tell her the least amount to spend to get all the N items.
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...
Related questions
Question
Course: Python
Transcribed Image Text:Example: Code the given problem using python
Donna likes to shop online. The main reason is that she gets a lot of offer! There
are M online shops from where she purchases her items. The prices of the same item
vary in both the shops. She needs to buy N items in all. And each she can buy each item
in any one of the shops. All the shops offer certain offer. If she buys the h item in one
shop, she gets a offer coupon for the i+ 1th item in the same shop. But if she purchases
the i+1th item from a different shop, she cannot use the offer coupon.
For example, if she buys the th item in Shop j and gets a offer of X pounds. Let the price
of i+1th item be Y pounds in shop j and Z pounds in shop k. If she purchases
the i+1th item from shop j she can use the offer coupon and hence, will have to pay Y-
X pounds. If she purchases the i+1th item from shop k she cannot use the offer coupon
and hence, will have to pay Z pounds.
Note: If the offer given is more than price of the item in the shop, i.e. if Y-X < 0, the item
is given free but she does NOT get any money back.
Donna wants to spend as less as possible and wants your help. She starts buying from
item 1 and goes on till item N in that order. Your task is simple. Tell her the least amount
to spend to get all the N items.
Input:
1
24
1234
4321
2321
1211
Output:
2.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY