Hi Codeforces!

I'm dealing with a problem, given N workers, each one with time intervals in which they can work and M tasks, each one represented as an interval [from, to]. The problem is to assign all the tasks to the workers in such a way that worker's restrictions are met. Also, each worker can only work in one task at the same time. It is guaranteed that a solution exists.

Assume that N and M are less than 100 and the intervals are between 0 and 20000.

I have a greedy approach, but not sure if it always works. I will be grateful if anyone can help me with any approach, idea or paper.

Thanks!