A shop is offering a special discount on candies. For every $2$ candies purchased at their regular prices, you can choose a $3$rd candy to take for free. The cost of the free candy must be less than or equal to the minimum cost of the $2$ purchased candies.

You are given an integer array cost, where cost[i] denotes the price of the candy at index i. Return the minimum total cost required to acquire all candies.

Constraints:

• $1 \leq$ cost.length $\leq 100$

• $1 \leq$ cost[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.