"""
Exercise 2: Minimum Cost to Connect Sticks (LeetCode 1167)

Connecting sticks of lengths x and y costs x + y. Return the minimum total
cost to connect all sticks. Greedy: always connect the two shortest.
"""

def connect_sticks(sticks):
    # TODO
    return 0


# --- self-check: do not modify below this line ---
a, b, c = connect_sticks([2, 4, 3]), connect_sticks([1, 8, 3, 5]), connect_sticks([5])
print(a, b, c)
print("PASS" if (a, b, c) == (14, 30, 0) else "FAIL")