Simple Python Solution
\nclass Solution:\n    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:\n        \n        \n        seats = sorted(seats, reverse = Fals
```\nclass Solution:\n    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:\n        \n        \n        seats = sorted(seats, reverse = False)\n        students = sorted(students, reverse = False)\n\n        count = 0\n        for x in range (len(seats)):\n            count+= abs(seats[x]-students[x])\n            \n        return count\n            \n        \n```
[]