Python ✅✅✅ || Faster than 86.11%, Memory Beats 97.69%
Code\n\nclass Solution:\n    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:\n        moves = 0\n        seats.sort()\n        students.
# Code\n```\nclass Solution:\n    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:\n        moves = 0\n        seats.sort()\n        students.sort()\n        for s in range(len(students)):\n            moves += abs(students[s]-seats[s])\n        return moves\n```\n\n![image.png](https://assets.leetcode.com/users/images/72c84c67-12ab-4943-ba77-ffa3e8c88023_1669702259.6721807.png)\n![image.png](https://assets.leetcode.com/users/images/b195919f-0c94-480f-a862-fd4ece1799e6_1669702363.7398427.png)\n
['Python3']