Problem link — 1354D - Мультимножество
Solution link — 143561353

I am using segment tree. The time complexity of the code is O( n * ( (logN)^2 ) ) which should pass the time limit. I am also using ios_base::sync_with_stdio(0);cin.tie(0); for fast IO.

Problem link — 20C - Dijkstra?
Solution with custom comparator (give MLE) — 142440675
Solution without comparator (Accepted) — 142444892
The logic of both the solutions are same (Dijkstra). Only the implementation is different. Why does using a custom comparator give MLE?