- Time limit: 1.00 s
- Memory limit: 512 MB
You know the starting and ending time of each movie. What is the maximum total number of movies the club members can watch entirely if they act optimally?
The first input line has two integers $n$ and $k$: the number of movies and club members.
After this, there are $n$ lines that describe the movies. Each line has two integers $a$ and $b$: the starting and ending time of a movie.
Print one integer: the maximum total number of movies.
- $1 \le k \le n \le 2 \cdot 10^5$
- $1 \le a < b \le 10^9$