Python || 99.81% Faster || 5 Lines || Sorting
\nclass Solution:\n    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:\n        seats.sort()\n        students.sort()\n        c,n=0,len
```\nclass Solution:\n    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:\n        seats.sort()\n        students.sort()\n        c,n=0,len(seats)\n        for i in range(n): c+=abs(seats[i]-students[i])\n        return c\n```\n\n**Upvote if you like the solution or ask if there is any query**
['Sorting', 'Python', 'Python3']