I am trying to solve the problem RENT — Rent your airplane and make money on SPOJ using simple DP and Linear Search. Sorting the jobs according to their end_time and then using dp[i] to store the max profit that can be earned up to ith job by calculating the max profit that can be earned by including ith job and by excluding ith but I am getting wrong answer. Here is my solution link https://sapphireengine.com/@/gv9ow5