Minimum Number of Moves to Seat Everyone

There are n availabe seats and n students standing in a room. You are given an array seats of length n, where seats[i] is the position of the ith seat. You are also given the array students of length n, where students[j] is the position of the jth student.

You may perform the following move any number of times:

• Increase or decrease the position of the ith student by 1 (i.e., moving the ith student from position x to x + 1 or x - 1)

Return the minimum number of moves required to move each student to a seat such that no two students are in the same seat.

Note that there may be multiple seats or students in the same position at the beginning.

Example 1:

Input: seats = [2,1,4], students = [3,1,3]

Output: 2

Explanation:

• The first student is moved from position 3 to position 2 using 1 move.
• The second student at position 1 is not moved.
• The third student at position 3 to position 4 using 1 move.
  In total, 1 + 1 = 2 moves are used.

Example 2:

Input: seats = [4,1,5,9], students = [1,3,2,6]

Output: 7

Explanation:

• The first student is not moved.
• The second student is moved from position 3 to position 4 using 1 move.
• The third student is moved from position 2 to position 5 using 3 moves.
• The fourth student is moved from position 6 to position 9 using 3 moves.
  In total, 0 + 1 + 3 + 3 = 7 moves were used.

Constraints:

• n == seats.length == students.length
• 1 <= n <= 100
• 1 <= seats[i], students[j] <= 100

Company Tags

Please upgrade to NeetCode Pro to view company tags.