[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
<>利用STL库的sort() 对vector<vector<int>>排序
* 对于一维向量vector<int>排序直接调用sort()即可实现排序。 vector<int> a{1,0,3,2}; sort(a.begin(),
a.end()); //默认从小到大排序 // 0,1,2,3 sort(a.begin(),a.end(), greater<int>());
//从大到小排序 // 3,2,1,0
* 对于二维向量vector<vector<int>> clips， clips = [[0,2],[4,6],[8,10],[1,9],[1,5],[5,
9]] # 初始值
默认的排序结果是第一维从大到小，在第一维相同时第二维从大到小排列。
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],
也可以自定义排序规则，下面示例， 第一维从小到大，第一维相同时，第二维从大到小。
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],
注意：static 不可以省略。
