Help: Small code, getting TLE in nlogn

Revision en2, by cschill, 2022-02-15 03:44:33

This is my short solution unfortunately I am getting a TLE. I tried to calculate and I know that it should be a TLE, since 1e6 * 3.32 * 6 * 20 > 1e8 but this is the worst case complexity and chances are it may never be reached. I have seen that other have written nlogn solution as well using binary search. Could anyone help me optimize my solution a little bit. Thank you very much


  Rev. Lang. By When Δ Comment
en2 English cschill 2022-02-15 03:44:33 292 (published)
en1 English cschill 2022-02-15 03:39:17 196 Initial revision (saved to drafts)