13June2024 - 2037. Minimum Number of Moves to Seat Everyone.py

class Solution:
    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:
        seats.sort()
        students.sort()
        return sum(abs(seat - student) for seat, student in zip(seats, students))
# Time: O(nlogn) because of sorting