Make Money

Chef has $N$ bags and an integer $X$. The $i^{th}$ bag contains $A_i$ coins such that $A_i \leq X$. In one operation, Chef can: - Pick any bag and increase its coins to $X$. Formally, if he choses the $i^{th}$ bag, he can set $A_i = X$. Given that the cost of performing **each** operation is $C$ $(C \leq X)$ coins and Chef can perform the above operation any (possibly zero) number of times, de