99.75 % Faster || Very Easy || Java😎
class Solution {\n    public int minMovesToSeat(int[] seats, int[] students) {\n        int ans=0;\n        Arrays.sort(seats);//sorting array\n        Arrays.s
class Solution {\n    public int minMovesToSeat(int[] seats, int[] students) {\n        int ans=0;\n        Arrays.sort(seats);//sorting array\n        Arrays.sort(students);\n        \n        for(int i=0;i<seats.length;i++)\n        {\n            int dif=Math.abs(seats[i]-students[i]);//Math.abs for avoiding negative value\n            ans+=dif;//add answer\n        }\n        return ans;\n    }\n}
[]