Search:

The problem is just solved. I've done it on my own. Key here was a priority queue having maximum k elements and binary search by ranks of intervals.
Complexity O(n*logn)

And the code i've written. Can aynone tell me how to make it faster? Faster implementation?
Here i didn't print the indexes of intervals but it has to do it:
https://ideone.com/sYCVeL

I have a problem with one task.

The main content of this task is that we are given n invervals [a; b] and number k. We have to find the maximum common range of any k intervals and print the...