对vector排序
sort对vector排序:
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#define max(x,y) (x>y?x:y)
typedef long long ll;
using namespace std;
struct edge{
int s;
int e;
edge(int ss,int ee){
s = ss;
e = ee;
}
};
vector<edge>vc;
bool cmp(const edge&a,const edge&b){
return a.s < b.s;
}
int main(){
vc.push_back(edge(3,1));
vc.push_back(edge(2,2));
vc.push_back(edge(1,3));
sort(vc.begin(),vc.end(),cmp);
for(int i = 0;i<vc.size();i++){
cout<<vc[i].s;
}
return 0;
}
qsort对vector排序
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#define max(x,y) (x>y?x:y)
typedef long long ll;
using namespace std;
struct edge{
int s;
int e;
edge(int ss,int ee){
s = ss;
e = ee;
}
};
vector<edge>vc;
int cmp(const void*a,const void*b){
return (*(edge*)a).s - (*(edge*)b).s;
}
int main(){
vc.push_back(edge(3,1));
vc.push_back(edge(2,2));
vc.push_back(edge(1,3));
qsort(&vc[0],vc.size(),sizeof(vc[0]),cmp); //对vector排序注意&vc[0]
for(int i = 0;i<vc.size();i++){
cout<<vc[i].s;
}
return 0;
}
PS:注意cmp的不同(参数、返回值、返回值类型)
对普通结构体数组排序
注意: sort(a,a+100,cmp)
qsort(a,100,sizeof(a[0]),cmp)