There are n types of items in a shop, where the number of items of type i is denoted by quantity[i]. The price of the items is determined dynamically, where the price of the m items is equal to the remaining number of items of type i. There are m customers in line to buy the items from the shop, and each customer will buy exactly one item of any type.
The shopkeeper, being greedy, tries to sell the items in a way that maximizes revenue. Find the maximum amount the shopkeeper can earn by selling exactly one item to the customers optimally.
Function Description
Complete the function maximumAmount in the editor.
maximumAmount has the following parameter:
int quantity[n]: the number of items of each type
Returns
long integer: the maximum revenue possible
⸜(｡˃ ᵕ ˂ )⸝♡ Credit to chizzy_elect ᡣ𐭩ྀིྀི
Example 1:
Input: quantity = [10, 10, 8, 9, 1], m = 6
Output: 55
Explanation:Givenn = 5,quantity = [10, 80, 90, 30, 1],m = 6One of the optimal ways to sell the items is as follows:The maximum possible revenue is 55.
Example 2:
Input: quantity = [8, 8, 8, 8], m = 4
Output: 32
Explanation:Here,n = 4,quantity = [8, 8, 8, 8],m = 4The optimal way is to sell one item of each type. The total amount earned is 8 + 8 + 8 + 8 = 32.
Example 3:
Input: quantity = [1, 2, 4], m = 4
Output: 11
Explanation:One of the optimal ways to sell the items is as follows:
1 ≤ n ≤ 10^51 ≤ m ≤ 10^91 ≤ quantity[i] ≤ 10^9
input:
output: