There are $n$ seats and $n$ students in a room. You are given an integer array seats of length $n$, where seats[i] represents the position of the $i^{ {th}}$ seat. You are also given an integer array students of length $n$, where students[j] represents the position of the $j^{ {th}}$ student.

In one move, you can increase or decrease the position of any student by $1$.

Return the minimum number of moves required to move each student to a seat such that each student occupies a unique seat.

Note: Multiple seats or students can share the same initial position.

Constraints:

• n == seats.length == students.length

• $1 \leq$ n $\leq 100$

• $1 \leq$ seats[i], students[j] $\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.