Unimart is offering a dhamaka offer. Terms and conditions to gain the offer as follows: Unimart will provide a shopping bag which you can carry W weight at maximum load. (If you try to load more than W weight then it will fall on the ground and you will lose the offer forever) Unimart has N < 10 products with weight w1, w2, w3.etc. You can get only 1 product for each item. Input: WN maximum weight and number of products. Find the set of products and their sum so that you can use the maximum weight of your bag capacity. N integers represent weight product P1, P2.Pn. Output: Print selected products set and the sum of these products. Sample Input: 10 4 8924 20 4 10 745 90 8 23 10 17 23 45 Sample Output: 82 Sum: 10 10 54 Sum: 19 23 10 1234 57 Sum: 55 Output product set sequence doesn't matter but you have to find the optimal sum of weight so that maximizes the profit.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Unimart is offering a dhamaka offer.
Terms and conditions to gain the offer as follows:
Unimart will provide a shopping bag which you can carry W weight at maximum load. (If you try
to load more than W weight then it will fall on the ground and you will lose the offer forever)
Unimart has N < 10 products with weight w1, w2, w3.etc. You can get only 1 product for each
item.
Input:
WN maximum weight and number of products.
Find the set of products and their sum so that you can use the maximum weight of your bag
capacity. N integers represent weight product P1, P2.Pn.
Output:
Print selected products set and the sum of these products.
Sample Input:
10 4 8924
20 4 107 45
90 8 23 10 17234 5
Sample Output:
82 Sum: 10
10 5 4 Sum: 19
23 10 123457 Sum: 55
Output product set sequence doesn't matter but you have to find the optimal sum of weight so
that maximizes the profit.
Transcribed Image Text:Unimart is offering a dhamaka offer. Terms and conditions to gain the offer as follows: Unimart will provide a shopping bag which you can carry W weight at maximum load. (If you try to load more than W weight then it will fall on the ground and you will lose the offer forever) Unimart has N < 10 products with weight w1, w2, w3.etc. You can get only 1 product for each item. Input: WN maximum weight and number of products. Find the set of products and their sum so that you can use the maximum weight of your bag capacity. N integers represent weight product P1, P2.Pn. Output: Print selected products set and the sum of these products. Sample Input: 10 4 8924 20 4 107 45 90 8 23 10 17234 5 Sample Output: 82 Sum: 10 10 5 4 Sum: 19 23 10 123457 Sum: 55 Output product set sequence doesn't matter but you have to find the optimal sum of weight so that maximizes the profit.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education