## 1051. Height Checker

A school is trying to take an annual
photo of all the students. The students are asked to stand in a single file
line in **non-decreasing order** by height. Let this ordering be
represented by the integer array expected where expected[i] is the expected height of the i^{th} student in line.

You are given an integer array heights representing the **current
order** that the students are standing in. Each heights[i] is the height of the i^{th} student in line (**0-indexed**).

Return *the number of
indices where *heights[i] != expected[i].

**Example 1:**

**Input:**
heights = [1,1,4,2,1,3]

**Output:** 3

**Explanation:**

heights: [1,1,__4__,2,__1__,__3__]

expected: [1,1,__1__,2,__3__,__4__]

Indices 2, 4, and 5 do not match.

**Example 2:**

**Input:**
heights = [5,1,2,3,4]

**Output:** 5

**Explanation:**

heights: [__5__,__1__,__2__,__3__,__4__]

expected: [__1__,__2__,__3__,__4__,__5__]

All indices do not match.

**Example 3:**

**Input:**
heights = [1,2,3,4,5]

**Output:** 0

**Explanation:**

heights: [1,2,3,4,5]

expected: [1,2,3,4,5]

All indices match.

**Constraints:**

- 1 <= heights.length <= 100
- 1 <= heights[i] <= 100

__Solution to the above Question__

class Solution {

public:

int
heightChecker(vector<int>& heights) {

int count =0;

vector<int>expected=heights;

sort(expected.begin(),expected.end());

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

if(heights[i]!=expected[i]){

count++;

}

}

return count;

}

};

## 0 Comments

If you have any doubts/suggestion/any query or want to improve this article, you can comment down below and let me know. Will reply to you soon.