Function Description
Complete the function getMinAdjustments in the editor.
getMinAdjustments takes the following parameter:
Parameters
int videoScores[n]: the current relevance scores of videos in the recommendation system
int maxAdjustments: the maximum number of adjustments allowed
Returns
int: the minimum possible integer x required
Example 1
Input: videoScores = [1, 2, 3], maxAdjustments = 4
Output: 2
Explanation:
If x = 1, elements can be decreased by 1 in an operation and it would take a total of 6 adjustments to make all the elements non-positive which exceeds the maxAdjustments allowed.
If the chosen x = 2, then:
In the first operation, we decrease the first element. The array becomes
[-1, 2, 3]
In the second operation, we decrease the second element. The array becomes
[-1, 0, 3]
In the third operation, we decrease the third element. The array becomes
[-1, 0, 1]
In the fourth operation, we decrease the third element again. The array becomes
[-1, 0, -1]
Hence, x = 2 is the minimum possible integer respecting the given conditions. Thus, the answer is 2.
Constraints
1 ≤ n ≤ 10^5
1 ≤ videoScores[i] ≤ 10^9
n ≤ maxAdjustments ≤ 10^9
Function Description
Complete the function calculateTikTokShoppingCost in the editor below.
calculateTikTokShoppingCost has the following parameter(s):
Parameters
int vouchersCount: the number of discount vouchers
int prices[n]: an array representing the prices of the n items Alex wants to buy
Returns
int: the minimum total cost Alex will need to pay to purchase all the items
Formula
discounted_price = p / 2^k
Where:
pis the original price of the itemkis the number of vouchers used on that item
Example 1
Input: vouchersCount = 3, prices = [8, 2, 13]
Output: 9
Explanation:
🙂
Constraints
1 ≤ prices.length ≤ 10^5
1 ≤ vouchersCount ≤ 10^5
1 ≤ prices[i] ≤ 10^9
我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务，确保满分通过。如有需求，请随时联系我们。
We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.
