JAVA || BEST APPROACH || 99.98% FASTER
```\nclass Solution {\n    public int minMovesToSeat(int[] seats, int[] students) {\n        Arrays.sort(seats);\n        Arrays.sort(students);\n        int n 
```\nclass Solution {\n    public int minMovesToSeat(int[] seats, int[] students) {\n        Arrays.sort(seats);\n        Arrays.sort(students);\n        int n = seats.length;\n        int m = students.length;\n        int count = 0;\n        for( int i = 0; i < n ; i++){\n            if(seats[i] < students[i]){\n                count = count + students[i] - seats[i];\n            }\n            else{\n                count = count + seats[i] -students[i];\n            }\n        }\n        return count;\n    }\n}
['Sorting', 'Java']