Buy Two Chocolates Python Solution with Tests

lcpy gen -n 2706   # by problem number
lcpy gen -s buy_two_chocolates   # by problem name

Input: prices = [1,2,2], money = 3
Output: 0

Input: prices = [3,2,3], money = 3
Output: 3

class Solution:
    # Time: O(n)
    # Space: O(1)
    def buy_choco(self, prices: list[int], money: int) -> int:
        first = second = 101
        for price in prices:
            if price < first:
                second = first
                first = price
            elif price < second:
                second = price
        total = first + second
        return money - total if total <= money else money