laughing_philosopher's blog

stable_sort() vs sort()
By laughing_philosopher, history, 13 months ago, In English

I was solving the problem — https://codeforces.me/contest/976/problem/C

I got runtime Error for this submission — https://codeforces.me/contest/976/submission/332127114

But an AC for — https://codeforces.me/contest/976/submission/332127380

and the only difference between these two codes is use of stable_sort() (in AC sub) and sort() (in WA sub). When I searched on the internet I found out that the key difference between sort() and stable_sort() lies in their guarantee regarding the relative order of equivalent elements. But why would this lead to STATUS_ACCESS_VIOLATION?

  • Vote: I like it
  • +1
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
13 months ago, hide # |
← Rev. 2  
Vote: I like it +19 Vote: I do not like it 
else {
   if (a.first.second >= b.first.second)
      return true;
   else
      return false;
}

This part contains error. Change it to if (a.first.second > b.first.second). Reason: It is because the compare function must return false for equal elements. You can go to this link (http://www.cplusplus.com/reference/algorithm/sort/).

Also, https://codeforces.me/blog/entry/52037

→ Reply
»
13 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

https://codeforces.me/blog/entry/70237

→ Reply