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

Правка en1, от _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

Теги priorityqueue, c++ stl, sorting, string

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский _asmah98 2020-05-01 21:30:17 333 Initial revision (published)