c++ | easy
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minMovesToSeat(vector<int>& seats, vector<int>& students) {\n        \n        sort(seats.begin(),seats.end());\n        sort(students.begin(),students.end());\n        int count = 0;\n\n        for(int i=0;i<seats.size();i++)\n        {\n            count = count + abs(seats[i] - students[i]);\n        }\n\n        return count;\n\n\n    }\n};\n```
['C++']