C# One Line Linq Solutions
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nOrder arrays by Ascendi
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nOrder arrays by Ascending order.\nZip arrays into a single objet.\nSum the absolute diference between values.\n\n# Complexity\n- Time complexity: O(Nlog(N))\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(N)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\npublic class Solution {\n    public int MinMovesToSeat(int[] seats, int[] students) => seats.OrderBy(m => m)\n        .Zip(students.OrderBy(m => m), (seat, student) => new {seat, student})\n        .Sum(m => Math.Abs(m.seat - m.student));\n}\n```
['C#']