Minimum Number of Moves to Seat Everyone LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minMovesToSeat(vector<int> &seats, vector<int> &students) {
4
    sort(seats.begin(), seats.end());
5
    sort(students.begin(), students.end());
6

7
    int res = 0;
8
    for (int i = 0; i < seats.size(); i++) res += abs(seats[i] - students[i]);
9

10
    return res;
11
  }
12
};