영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
In a movie festival, n movies will be shown. Syrjälä's movie club consists of k members, who will be all attending the festival.
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?
Input
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.
Output
Print one integer: the maximum total number of movies.
Constraints
- 1 ≤ k ≤ n ≤ 2 · 10^5
- 1 ≤ a < b ≤ 10^9
예제
예제 1
5 2 1 5 8 10 3 6 2 5 6 9
4