<> utilize STL Library sort() yes vector<vector<int>> sort
* For one-dimensional vector vector<int> Sort direct call sort() Sorting can be realized . vector<int> a{1,0,3,2}; sort(a.begin(),
a.end()); // Default sort from small to large // 0,1,2,3 sort(a.begin(),a.end(), greater<int>());
// Sort from large to small // 3,2,1,0
* For 2D vectors vector<vector<int>> clips, clips = [[0,2],[4,6],[8,10],[1,9],[1,5],[5,
9]] # Initial value
The default sorting result is the first dimension from large to small , When the first dimension is the same, the second dimension is arranged from large to small .
sort(clips.begin(),clips.end()); for(int i=0;i<clips.size();i++){ cout<<'['<<
clips[i][0]<<','<<clips[i][1]<<']'<<','; } cout<<endl; //
[0,2],[1,5],[1,9],[4,6],[5,9],[8,10],
You can also customize the collation , The following example , First dimension from small to large , The first dimension is the same , The second dimension is from large to small .
static bool cmp(const vector<int>& v1, const vector<int>& v2){ if (v1[0] == v2[
0]) return v1[1]>v2[1]; return v1[0] < v2[0]; } sort(clips.begin(), clips.end(),
cmp); for(int i=0;i<clips.size();i++){ cout<<'['<<clips[i][0]<<','<<clips[i][1]
<<']'<<','; } cout<<endl; // [0,2],[1,9],[1,5],[4,6],[5,9],[8,10],
be careful ：static Cannot be omitted .
Technology