leetcode 1051. 高度检查器

class Solution {
public:
    int heightChecker(vector<int>& heights) {
        vector<int> temp = heights;
        sort(temp.begin(), temp.end());
        int res = 0;
        for(int i = 0; i < heights.size(); i++)
        {
            if(temp[i] != heights[i])
            {
                res++;
            }
        }
        return res;
    }
};