I suppose quicksort + binary is not the optimal one. In Java I'm having TLE#10. I tried the solution by dimozzz (in another topic), but only with some optimizations I could get AC 0.91s
Can anyone suggest really fast solution or the reason is that Java cannot perform better? (I didn't try in Pascal or C++).
