leetcode

0 class Solution {

1 public:

2 int heightChecker(vector<int> &heights) {

3 int count = 0;

4 vector<int> exp = heights;

5 sort(exp.begin(), exp.end());

6

7 for (int i = 0; i < heights.size(); i++)

8 if (heights[i] != exp[i]) count++;

9

10 return count;

11 }

12 };