## Description

You are given an integer array prices representing the prices of various chocolates in a store. You are also given a single integer money, which represents your initial amount of money.

You must buy exactly two chocolates in such a way that you still have some non-negative leftover money. You would like to minimize the sum of the prices of the two chocolates you buy.

Return the amount of money you will have leftover after buying the two chocolates. If there is no way for you to buy two chocolates without ending up in debt, return money. Note that the leftover must be non-negative.

Example 1:

Input: prices = [1,2,2], money = 3
Output: 0
Explanation: Purchase the chocolates priced at 1 and 2 units respectively. You will have 3 - 3 = 0 units of money afterwards. Thus, we return 0.


Example 2:

Input: prices = [3,2,3], money = 3
Output: 3
Explanation: You cannot buy 2 chocolates without going in debt, so we return 3.


Constraints:

• 2 <= prices.length <= 50
• 1 <= prices[i] <= 100
• 1 <= money <= 100

## Solutions

• class Solution {
public int buyChoco(int[] prices, int money) {
Arrays.sort(prices);
int cost = prices + prices;
return money < cost ? money : money - cost;
}
}

• class Solution {
public:
int buyChoco(vector<int>& prices, int money) {
sort(prices.begin(), prices.end());
int cost = prices + prices;
return money < cost ? money : money - cost;
}
};

• class Solution:
def buyChoco(self, prices: List[int], money: int) -> int:
prices.sort()
cost = prices + prices
return money if money < cost else money - cost


• func buyChoco(prices []int, money int) int {
sort.Ints(prices)
cost := prices + prices
if money < cost {
return money
}
return money - cost
}

• function buyChoco(prices: number[], money: number): number {
prices.sort((a, b) => a - b);
const cost = prices + prices;
return money < cost ? money : money - cost;
}


• impl Solution {
pub fn buy_choco(mut prices: Vec<i32>, money: i32) -> i32 {
prices.sort();

let sum = prices + prices;
if sum > money {
return money;
}

money - sum
}
}