Regarding time complexity of erase in std::set
Difference between en4 and en5, changed 0 character(s)
Is there any massive time complexity difference between erasing a value from the set using -- set_name.erase(iterator)↵
and set_name.erase(set_name.find(iterator)) when we are sure that iterator refers to a value present in the set..i am asking this because [this](https://codeforces.com/contest/1399/submission/89175666) shows time limit exceeded but [this](https://codeforces.com/contest/1399/submission/89176787) one does not shows any time limit exceeded ...please help

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English divyanshuGupta 2020-08-07 09:18:18 0 (published)
en4 English divyanshuGupta 2020-08-07 09:17:34 1 Tiny change: '/89176787)one does n' -> '/89176787) one does n'
en3 English divyanshuGupta 2020-08-07 09:16:47 14
en2 English divyanshuGupta 2020-08-07 09:15:04 22
en1 English divyanshuGupta 2020-08-07 09:12:39 528 Initial revision (saved to drafts)