You are given an array of positive integers beans, where each integer represents the number of magic beans contained in a bag.

You want to remove beans from the bags such that every remaining non empty bag contains the exact same number of magic beans. You can remove any number of beans from any bag, including emptying it completely, but you cannot add beans to any bag.

Return the minimum total number of magic beans that must be removed.

Constraints:

• $1 \leq$ beans.length $\leq 10^5$

• $1 \leq$ beans[i] $\leq 10^5$

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.