![image](https://assets.leetcode.com/users/images/9c49b1ee-3b07-49c1-9b73-1484687cdf15_1648896625.515795.png)\n\n ![image](https://assets.leetcode.com/users/images/2f67c0a7-eff4-4310-81c4-a7baf812ca5e_1648896687.618098.png)\n\n\nI could not pass all the test cases and got TLE.\nCan someone help with an optimal solution\n\nHow to practice such kind of questions?\n\n**EDIT**\nI used priority queue to solve this one. It only passed 5 of the test cases and got TLE on the rest.\nCan we do better than n(logn)?

\n\n \n\n\nI could not pass all the test cases and got TLE.\nCan someone help with an optimal solution\n\nHow to practice such kind of questions?\n\nEDIT\nI use