Java Simple Solution
\nclass Solution {\n    public int minMovesToSeat(int[] seats, int[] students) {\n        Arrays.sort(seats);\n        Arrays.sort(students);\n        int noMov
```\nclass Solution {\n    public int minMovesToSeat(int[] seats, int[] students) {\n        Arrays.sort(seats);\n        Arrays.sort(students);\n        int noMoves = 0;\n        for (int i = 0; i < seats.length; ++i) {\n            noMoves += Math.abs(seats[i] - students[i]);\n        }\n        return noMoves;\n    }   \n}\n```
[]