Statement

Giorgio is so confident in his poker skills that he is planning his participation in the next N tournaments based on the assumption that he will always win. However, the plan is not trivial since some tournaments may overlap, and others may be too expensive to participate in! More precisely, each tournament i for =0 … N-1 is held in day D_i, starts at time S_i, ends at time E_i, has a buy-in of a poker tournament is the participation fee required to access it. B_i and a prize P_i. Before the start of the tournaments, Giorgio was able to borrow M euros from friends to spend on buy-ins. Now, Giorgio has to select a subset of the tournaments such that for each i among them: (1) every other selected tournament j on the same day does not overlap (i.e., either S_i ≥ E_j or S_j ≥ E_i); (2) Giorgio is able to pay for the buy-in B_i, assuming to have collected all the prizes for the selected tournament j finished before the start of i...