✅ One Line Solution
Code #1\nTime complexity: O(nlog(n)). Space complexity: O(n).\n\nclass Solution:\n    def minMovesToSeat(self, a: List[int], b: List[int]) -> int:\n        retu
# Code #1\nTime complexity: $$O(n*log(n))$$. Space complexity: $$O(n)$$.\n```\nclass Solution:\n    def minMovesToSeat(self, a: List[int], b: List[int]) -> int:\n        return sum(map(abs,map(sub,*map(sorted,(a,b)))))\n```\n\n# Code #2\nTime complexity: $$O(n*log(n))$$. Space complexity: $$O(n)$$.\n```\nclass Solution:\n    def minMovesToSeat(self, a: List[int], b: List[int]) -> int:\n        return sum(map(abs,map(sub,sorted(a),sorted(b))))\n```\n\n# Code #3\nTime complexity: $$O(n*log(n))$$. Space complexity: $$O(n)$$.\n```\nclass Solution:\n    def minMovesToSeat(self, a: List[int], b: List[int]) -> int:\n        return sum(abs(v-u) for v,u in zip(sorted(a),sorted(b)))\n```
['Array', 'Sorting', 'Python', 'Python3']