Can someone tell me how to approach this problem?
You are given N tasks with following information:
Deadline: D i
Reward: R i
Time taken to complete the tasks: P i
The reward is given only when a task is completed within the corresponding deadline.
Write a program to schedule the tasks in order to maximise the reward.
First line: T (number of test cases) First line in each test case: N Next N lines in each test case: Three space-separated integers Di, Ri, and Pi
For each test case, print the schedule of tasks that maximizes the reward in new line.
1 6 1 2 1 2 3 1 4 1 2 10 10 10 15 13 10 15 7 5
If we perform the last two task alone we can get the maximum reward which is 20