Sale

You are given prices of items in a shop. The task is to compute the minimum amount of money needed to buy all items when the shop applies a discount rule: among the items considered together, the cheapest one becomes free or gets the required discount according to the problem's sale logic.

For this problem, think of the key idea as identifying the cheapest eligible item(s) after sorting the prices and applying the discount rule to the items that matter. The goal is to produce the final total cost after the sale is applied to the full list.

Intuition

• Sort prices so the cheapest relevant items are easy to identify.
• Sum the remaining prices after the discount is applied.
• This is a straightforward implementation problem with sorting.

Input Format

• The first line contains an integer $n$ — the number of items.
• The second line contains $n$ integers describing the item prices.

Output Format

• Print one integer: the final total cost after applying the sale rule.

Constraints

• $1 \le n \le 10^5$
• Prices are positive integers.
• The answer fits in a 64-bit signed integer.

Hints

• Sorting is usually the easiest way to reason about discount-style rules.
• Check which items are actually discounted and which are fully paid.