STL---sort

引用：http://blog.csdn.net/rattles/archive/2010/04/21/5510919.aspx

STL

??????????????????bool cmp(int a,int b)

{

???}

????struct node{

?????????}

??以下是代码片段：

bool cmp(node x,node y)

{

if(x.a!=y.a) return x.a

if(x.b!=y.b) return x.b>y.b;

return return x.c>y.c;

}

??????以下是代码片段：

#include<iostream>

#include<algorithm>

#include<string>

using namespace std;

//struct node{

string a,b;

};

//ASCII////bool lt(string x,string y)

{

int i;

for(i=0;i<x.length();i++)

if(x[i]>='A'&&x[i]<='Z')

??for(i=0;i<y.length();i++)

if(y[i]>='A'&&y[i]<='Z')

??return x<y;

}

////bool comp(node x,node y)

{

if(x.b!=y.b)return x.b<y.b;

return lt(x.a,y.a);

}

int main()

{

node arr[10001];

int size=0;

while(cin>>arr[size].a>>arr[size].b)

size++;

sort(arr,arr+size,comp);

for(int i=0;i<size;i++)

cout<<arr[i].a<<" "<<arr[i].b<<endl;

return 0;

}

?

?

七种<一、对int??Sample:????

int??{????

return??}????

qsort(num,100,sizeof(num[0]),cmp);????

二、对char??Sample:????

int??{????

return??}????

qsort(word,100,sizeof(word[0]),cmp);????

三、对double??int??{????

return??}????

qsort(in,100,sizeof(in[0]),cmp)四、对结构体一级排序struct??{????

double??int??}s[100]????

//int??{???

return??}????

qsort(s,100,sizeof(s[0]),cmp);????

五、对结构体二级排序struct??{????

int??int??}s[100];????

//int??{????

struct??struct??if(c->x??else??}qsort(s,100,sizeof(s[0]),cmp);????

六、对字符串进行排序struct??{????

int??char??}s[100];????

//int??{????

return??}????

qsort(s,100,sizeof(s[0]),cmp);????