Maximum Number of Events That Can Be Attended II

Given a list of weighted intervals and an integer k, pick at most k non-overlapping events (end days are inclusive) to maximize the total value. The core challenge is interval scheduling under a cardinality constraint, typically solved by sorting plus DP/memoization that uses binary search to jump to the next non-overlapping event.