Vector sort 排序

利用sort最重要的是重载比较函数

sort（排序元素的首地址，排序元素的尾地址，比较函数）

#include <iostream>#include <algorithm>#include <vector>using namespace std;struct node{ int beg; int end; node(int b,int e){ beg = b; end = e; }};int cmp(node & a,node &b){return a.beg < b.beg;}vector<node> myVector;void input(){int n,b,e; freopen("in.txt","r",stdin);cin>>n;for(int i = 0 ; i < n ; i++){cin>>b>>e;myVector.push_back(node(b,e));}fclose(stdin);}void output(){for(vector<node>::iterator it = myVector.begin(); it != myVector.end(); it ++){cout<<it->beg<<" "<<it->end<<endl;}}int main(){input();sort(myVector.begin(),myVector.end(),cmp);//sort的写法output();return 1;}