A school is trying to arrange students in nondecreasing order of their heights. You are given an integer array heights representing the current order of the students.

Let expected be the array representing heights sorted in nondecreasing order.

Return the total number of indices i where heights[i] \neq expected[i].

Constraints:

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

• $1 \leq$ heights[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.