hi, I’m trying to solve this problem, any hint will be appreciated.

There are some horizontal segments in the axis. We want to remove minimum number of segments in order to any vertical line can cross at most t of them ,where t<=K. Given n segment and their descriptions (y x1 x2) and K. solve this problem with a good time order.

This isn’t a Programming Contest problem, so there is no explicit range for n and x1 x2 y.

Hi, I'm so interested for knowing some hints for this problem : http://uva.onlinejudge.org/contests/309-2f118707/a.html

any help will be appreciated.