Would like to comment on this problem. This is a very tough one. The very naive implementation can only get you to the first 15 testcases. To pass the rest of the testcases you need to do something very clever utilizing maxheap or maxsegment tree. This problem should probably be elevated to the expert level considering that only few people really solved it. By that I also mean that even though there are currently around 120 accepted solutions, almost 100 of them are carbon copies of two different solutions one written in 'cpp' and another written in 'c'. It is a shame that HackerRank would let anybody submit literary identical copies of the code.