You are given an array a representing heights of students. all the students are asked to stand in rows. the students arrive by one, sequentially (as their heights appear in a). for the i-th student, if there is a row in which all the students are taller than a[i], the student will stand in one of such rows. if there is no such row, the student will create a new row. your task is to find the minimum number of rows created. test cases

The minimum number of rows is 1: if A is sorted in descending order, every next students will arrive in a row where everyone is taller than him, and no new rows will be created.

For example, consider

A = [190, 175, 170, 165, 150]

The first students creates the first row.

The second student is 175cm tall. In the first row everyone is taller than him (there's only the 190cm student), so he'll stand in this row.

The third student, 170cm, will find the row filled by the students who are 190 and 175cm tall. So, everyone is taller than him and he'll stand in that row as well.

You keep going with the other students, and you'll see that no one will form a new row.

The output is approximately 0.296630 but it rounds to 0.3 which is the answer

Step-by-step explanation: