PivotOJ

The Moo Particle

시간 제한: 1000ms메모리 제한: 512MB출처: USACO 2020 US Open Contest, SilverBOJ 18879

문제

Quarantined for their protection during an outbreak of COWVID-19, Farmer John's cows have come up with a new way to alleviate their boredom: studying advanced physics! In fact, the cows have even managed to discover a new subatomic particle, which they have named the "moo particle".

The cows are currently running an experiment involving NN moo particles (1N1051 \leq N \leq 10^5). Particle ii has a "spin" described by two integers xix_i and yiy_i in the range 109109-10^9 \ldots 10^9 inclusive. Sometimes two moo particles interact. This can happen to particles with spins (xi,yi)(x_i, y_i) and (xj,yj)(x_j, y_j) only if xixjx_i \leq x_j and yiyjy_i \leq y_j. Under these conditions, it's possible that exactly one of these two particles may disappear (and nothing happens to the other particle). At any given time, at most one interaction will occur.

The cows want to know the minimum number of moo particles that may be left after some arbitrary sequence of interactions.

입력

The first line contains a single integer NN, the initial number of moo particles. Each of the next NN lines contains two space-separated integers, indicating the spin of one particle. Each particle has a distinct spin.

출력

A single integer, the smallest number of moo particles that may remain after some arbitrary sequence of interactions.

예제

예제 1

입력
4
1 0
0 1
-1 0
0 -1
출력
1

예제 2

입력
3
0 0
1 1
-1 3
출력
2
코드를 제출하려면 로그인하세요.