this will not work now, they have added a test case which gives TLE, need to find a better solution than O(N*K).

I saw a solution using TreeMap,

However instead of using two priority queue's we use two Tree Sets as we want O(logk) for remove(element). Priority Queue...