[Python3] Easy solution (sorting)
Сomputing sum of the differences between elements of the sorted lists:
Сomputing sum of the differences between elements of the sorted lists:

```python []
class Solution:
    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:
        moves = 0
        
        for seat, student in zip(sorted(seats), sorted(students)):
            moves += abs(seat - student)
            
        return moves
```
['Python', 'Python3']