문제

2037. Minimum Number of Moves to Seat Everyone

풀이

💻 결과코드

import java.util.*;

class Solution {
    public int minMovesToSeat(int[] seats, int[] students) {
        int result = 0;

        Arrays.sort(seats);
        Arrays.sort(students);

        for (int i = 0; i < seats.length; i++) {
            result += Math.abs(seats[i] - students[i]);
        }

        return result;
    }
}