Compute total after discounting most expensive item

Problem

You are given:

• An array prices of length n , where prices[i] is the price of the i-th item.
• An integer discountPercent (0 to 100).

A promotion applies only to one item: the most expensive item receives discountPercent percent off. If there are multiple items tied for the maximum price, discount any one of them (the result is the same).

The discounted amount may be fractional. The final amount to pay is:

$\left\lfloor \sum prices - (\max(prices) \cdot discountPercent/100) \right\rfloor$

Return the final amount to pay as an integer.

Input

• prices : array of non-negative numbers (integers or decimals)
• discountPercent : integer in [0, 100]

Output

• Integer: the floored total amount to pay.

Constraints (typical)

• 1 <= n <= 2 * 10^5
• 0 <= prices[i] <= 10^9

Example

• prices = [100, 50, 25] , discountPercent = 20
  • max price = 100, discount = 20
  • total = floor(175 - 20) = 155