Given length of wall w and shelves of two lengths m and n, find the number of each type of shelf to be used and the remaining empty space in the optimal solution so that the empty space is minimum. The larger of the two shelves is cheaper so it is preferred. However cost is secondary and first priority is to minimize empty space on wall.
Input : w = 24 m = 3 n = 5 Output : 3 3 0 We use three units of both shelves and 0 space is left. 3 * 3 + 3 * 5 = 24 So empty space = 24 - 24 = 0 Another solution could have been 8 0 0 but since the larger shelf of length 5 is cheaper the former will be the answer. Input : w = 29 m = 3 n = 9 Output : 0 3 2 0 * 3 + 3 * 9 = 27 29 - 27 = 2 Input : w = 24 m = 4 n = 7 Output : 6 0 0 6 * 4 + 0 * 7 = 24 24 - 24 = 0
A simple and efficient approach will be to try all possible combinations of shelves that fit within the length of the wall.
To implement this approach along with the constraint that larger shelf costs less than the smaller one, starting from 0, we increase no of larger type shelves till they can be fit. For each case we calculate the empty space and finally store that value which minimizes the empty space. if empty space is same in two cases we prefer the one with more no of larger shelves. Below is its implementation.
3 3 0 6 0 0
References: Sumologic Internship question
This article is contributed by Aditi Sharma. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Applications of Minimum Spanning Tree Problem
- Activity Selection Problem | Greedy Algo-1
- K Centers Problem | Set 1 (Greedy Approximate Algorithm)
- Set Cover Problem | Set 1 (Greedy Approximate Algorithm)
- Bin Packing Problem (Minimize number of used Bins)
- Job Sequencing Problem | Set 2 (Using Disjoint Set)
- Max Flow Problem Introduction
- Job Sequencing Problem - Loss Minimization
- Job Selection Problem - Loss Minimization Strategy | Set 2
- Water Connection Problem
- Problem Solving for Minimum Spanning Trees (Kruskal’s and Prim’s)
- Water drop problem
- Proof that traveling salesman problem is NP Hard
- Travelling Salesman Problem | Greedy Approach
- C++ Program for the Fractional Knapsack Problem
- Lead a life problem
- Shortest Superstring Problem
- Job Sequencing Problem
- Fractional Knapsack Problem
- Extended Knapsack Problem