Minimum Number of Moves to Seat Everyone

There are n seats and n students in a room. You are given an array seats of length n, where seats[i] is the position of the i<sup>th</sup> seat. You are also given the array students of length n, where students[j] is the position of the j<sup>th</sup> student.

You may perform the following move any number of times:

• Increase or decrease the position of the i<sup>th</sup> student by 1 (i.e., moving the i<sup>th</sup> student from position x to x + 1 or x - 1)

Return theminimum number of movesrequired 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.

LeetCode Problem - 2037

class Solution {
    public int minMovesToSeat(int[] seats, int[] students) {
        // Sort both arrays to facilitate minimal adjustments calculation
        Arrays.sort(seats);
        Arrays.sort(students);

        int count = 0; // Initialize the total count of moves

        // Calculate the sum of absolute differences between corresponding elements
        for(int i = 0; i < seats.length; i++){
            count += Math.abs(seats[i] - students[i]);
        }

        return count; // Return the total moves required
    }
}