Kotlin one-liner
Intuition\n Describe your first thoughts on how to solve this problem. \nsort the lists, get the difference of the values then sum\n\n# Complexity\n- Time compl
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nsort the lists, get the difference of the values then sum\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n log n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n)\n\n# Code\n```\nclass Solution {\n    fun minMovesToSeat(seats: IntArray, students: IntArray) = \n        seats.sorted().zip(students.sorted()) { a, b ->\n            abs(a - b)\n        }.sum()\n}\n\n\n```
['Kotlin']