There are total N sellers. Each sellers has arr[i] items. Every time an item sold the seller will raise the price by 1. And your profit on any item is equals to the number of items the seller has left. Your job is to buy K items from N sellers and make the highest profit. Input N, an integer representing the number of sellers; arr a list of long integers representing the supply of the ith seller; K, a long integer representing the number of items to be ordered. Output Return a long integer representing the highest profit that can be generated. Examplel: Input: N = 2 arr = [3, 4] K = 6 Output: 15 Explanation: Here seller one has 3 items. The final prices are [3, 2, 1]. Here seller two has 4 items. The final prices are [4, 3, 2, 1] The highest profit is 4 + 2 * 3 + 2 * 2 + 1 = 15 Example2: Input: N = 5 arr = [3, 5, 7, 10, 6] K = 20 Output: 107
There are total N sellers. Each sellers has arr[i] items. Every time an item sold the seller will raise the price by 1. And your profit on any item is equals to the number of items the seller has left. Your job is to buy K items from N sellers and make the highest profit.
Input N, an integer representing the number of sellers;
arr a list of long integers representing the supply of the ith seller;
K, a long integer representing the number of items to be ordered.
Output
Return a long integer representing the highest profit that can be generated.
Examplel:
Input: N = 2 arr = [3, 4] K = 6
Output: 15
Explanation: Here seller one has 3 items. The final prices are [3, 2, 1]. Here seller two has 4 items. The final prices are [4, 3, 2, 1] The highest profit is 4 + 2 * 3 + 2 * 2 + 1 = 15
Example2:
Input: N = 5 arr = [3, 5, 7, 10, 6] K = 20
Output: 107
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 4 images
