Rating changes for the last round are temporarily rolled back. They will be returned soon. ×

Doubt in Priority Queue of strings complexity (TLE in recent div2 problem C)

Revision en1, by _asmah98, 2020-05-01 21:30:17

I know it is an overkill to use Priority Queue in recent Div 2 problem C but why does using it gives TLE on test case 32 in problem C ? isn't it O(nlogn), which should pass ?

Link to Submission

Tags priorityqueue, c++ stl, sorting, string


  Rev. Lang. By When Δ Comment
en1 English _asmah98 2020-05-01 21:30:17 333 Initial revision (published)