Sugar Rush

After a lot of effort, Mausil Hash of SDC has been able to convince Sarma Templeton Investments to take placements interview. While you were browsing through the previous year's questions you came across the following question. The problem statement is as follows: There are $N$ piles of chocolates where each pile has $C_i$ number of chocolates. At each turn you will select a pile and eat $K$ choco