Stupid O(M*K) solution works about 0.421s (modified "greedy activity selector").
But i heard about segment_tree/heap solutions - i can't understand what are they speaking about. How to improve O(M*K) ?