Given an array containing weights of gifts, and an integer K representing maximum weight a box can contain (All boxes are uniform). Each box carries at most 2 gifts at the same time, provided the sum of the weight of those gifts is at most limit of box. The task is to find the minimum number of boxes required to carry all gifts.
Note: It is guaranteed each gift can be carried by a box.
Input: A = [3, 2, 2, 1], K = 3
Explanation: 3 boxes with weights (1, 2), (2) and (3)
Input: A = [3, 5, 3, 4], K = 5
Explanation: 4 boxes with weights (3), (3), (4), (5)
Approach: If the heaviest gift can share a box with the lightest gift, then do so. Otherwise, the heaviest gift can’t pair with anyone, so it get an individual box.
The reason this works is because if the lightest gift can pair with anyone, it might as well pair with the heaviest gift.
Let A[i] be the currently lightest gift, and A[j] to the heaviest.
Then, if the heaviest gift can share a box with the lightest gift (if A[j] + A[i] <= K) then do so otherwise, the heaviest gift get an individual box.
Below is the implementation of above approach:
Time Complexity: O(N*log(N)), where N is the length of array.
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.
- Color all boxes in line such that every M consecutive boxes are unique
- Minimum time required to transport all the boxes from source to the destination under the given constraints
- Minimum number of stacks possible using boxes of given capacities
- Count of carry operations on adding two Binary numbers
- Count of minimum reductions required to get the required sum K
- Number of visible boxes after putting one inside another
- Count the number of ways to fill K boxes with N distinct items
- Find the number of boxes to be removed
- Minimize number of boxes by putting small box inside bigger one
- Minimum Swaps required to group all 1's together
- Minimum swaps required to bring all elements less than or equal to k together
- Minimum operations required to make all Array elements divisible by K
- Minimum no. of operations required to make all Array Elements Zero
- Minimum number of operations required to delete all elements of the array
- Minimum operations required to make all the array elements equal
- Find the minimum number of operations required to make all array elements equal
- Minimum steps required to reduce all the elements of the array to zero
- Minimum changes required to make all element in an array equal
- Minimum Number of Bullets required to penetrate all bricks
- Minimum jumps required to group all 1s together in a given Binary string
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.