Minimum Number of Moves to Seat Everyone LeetCode solution in JavaScript

1
var minMovesToSeat = function (seats, students) {
2
  let sum = 0;
3
  seats = seats.sort((a, b) => a - b);
4
  students = students.sort((a, b) => a - b);
5
  for (let i = 0; i < seats.length; i++)
6
    sum += Math.abs(seats[i] - students[i]);
7
  return sum;
8
};