시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
3 초 1024 MB 5 5 4 100.000%

## 문제

As one gets older, it becomes harder to keep track of the latest fads and trends. The latest mind-boggling trend is actually sweeping through elementary schools: young children love rocks, even more than they love paper or scissors. As recess ends, Ms. Frizz needs to round up her class. Before going back to the classroom, the students all get in a line, holding bags full of rocks that they've mined from the playground.

The kids in this class are a dangerous combination of personality traits: they are jealous, smart, eagle-eyed, and good at counting. Each child knows how many rocks every child in front of them has. That is, the line leader knows their own rock total, the second kid in line knows the amount of rocks they have and the line leader has, the third student knows the rock totals of the first three students in line, and so on.

If a kid knows about another kid in front of them that has the same or more rocks than them, they begin crying. The line-leader never cries, as they have to set a mature, stoic example for their classmates.

If Ms. Frizz arranges the students optimally, what is the minimum number of students that are crying after recess?

## 입력

The first line of input is an integer $N$ ($1 \leq N \leq 10^5$. Class sizes are getting large due to budget cuts). The next line has $N$ space-separated integers; the $i$-th is the number of rocks child $i$ has. Each child has at least $1$ and at most $10^9$ rocks.

## 출력

Output a single integer: the minimum number of children who are crying if the students are arranged optimally.

## 예제 입력 1

6
1 2 1 2 1 2


## 예제 출력 1

4


## 예제 입력 2

3
12 12 12


## 예제 출력 2

2


## 힌트

In the first sample, the optimal arrangement is $[1, 1, 1, 2, 2, 2]$. Then the students at indices $2, 3, 5$ and $6$ ($1$-indexed) are crying. No other arrangement has fewer crying children.

In the second sample, all of the kids have the same number of rocks, so any arrangement of them results in two crying children.

## 출처

• 문제를 만든 사람: Arnav Sastry, Ethan Arnold