Minimum Number of Moves to Seat Everyone LeetCode solution in Python

1
class Solution:
2
    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:
3
        seats.sort()
4
        students.sort()
5
        return sum(abs(seat - student) for seat, student in zip(seats, students))