Movie Festival II

CSESSorting and SearchingOpen on judge ↗

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 ar

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI