Problem · Heap
Minimum Total Weight
Learn this problem● Medium
SnowflakeINTERNOA
See Snowflake hiring insightsSnowflakeINTERNOAProblem statement
There are n chocolates and the weight of the chocolates is given as an array of integers weights[n], where weights[i] denote the weight of the ith chocolate. Every day, one can pick one chocolate, eat half of it, and put the remaining half back. Find the minimum possible total weight of the remaining chocolates after d days. Note that one can eat the same chocolate multiple times. The weight of the part eaten can be calculated as floor(weights[i]/2).
Function
findMinWeight(weights: int[], d: int) → int
Complete the function findMinWeight in the editor below.
findMinWeight has the following parameters:
int weights[n]: an array of integers representing weights of chocolates, indexed0ton-1int d: an integer representing the number of days
Returns
int: the minimum total weight of chocolates after d days.
𓆝﹏𓊝﹏🫧A heartfelt thank you to A 🐳﹏⋆｡°
Examples
Example 1
weights = [30, 20, 25]d = 4return = 31
Day Weight of the chocolate picked Weight eaten Remaining weight Result
- 1 20 10 10 [30,10,25]
- 2 25 12 13 [30,10,13]
- 3 30 15 15 [15,10,13]
- 4 15 7 8 [8, 10, 13]
Example 2
weights = [2]d = 1return = 1On day 1, eat the chocolate with weight 2, and the remaining weight becomes 1. The array becomes [1], with the sum of weights 1.
Example 3
weights = [2, 3]d = 1return = 4On day 1, pick either of the chocolates:
- chocolate with weight 2, weights' = [1, 3], with a total weight of 4.
- chocolate with weight 3, weights' = [2, 2], with a total weight of 4.
Constraints
1 ≤ n ≤ 10^51 ≤ weights[i] ≤ 10^4 (where 0 ≤ i < n)1 ≤ d ≤ 2*10^6