Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×
HELP in implementation of sort STL for vector pair C++
Difference between en1 and en2, changed 16 character(s)
I had a vector of pairs. I wanted it sorted in descending according to the first value of the vector. ↵
↵
~~~~~↵
sort(a.begin(),a.end(),[](pair<int,int> &left, pair<int,int> &right){↵
         return left.first >= right.first;↵
});↵
~~~~~↵
↵
This gave me TLE. Sorting it normally ↵
↵
~~~~~↵
sort(a.begin(),a.end());↵
~~~~~↵
↵
and iterating from the end worked. ↵
↵
Why does the first sorting function give TLE? Do I have to implement it some other way?↵
↵

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English hell_hacker 2017-09-13 19:06:50 16
en1 English hell_hacker 2017-09-13 19:00:22 494 Initial revision (published)