first i use RB tree (set in C++) and got AC in 0.796s and when i use heap i AC in 0.156s. my algo is (n^2* log(n)).
GOOD LUCK!!!