I tried a solution based on dp but I am getting WA: link to my solution: https://mirror.codeforces.com/contest/1113/submission/136000085

I got the greedy approach, just want to know if it can be solved using dp and what I am missing in dp.