Vector容器排序

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

struct Student
{
string name;
int id;
};

class StudentSort
{
public:
bool operator () (const Student a, const Student b) const
{
return a.id < b.id;
};
};

bool sortTest(const Student a, const Student b)
{
return a.id > b.id;
};

int main()
{
std::vector<Student> someStudents;
Student st;
st.name = "张三";
st.id = 2;
someStudents.push_back(st);
st.name = "李四";
st.id = 1;
someStudents.push_back(st);
st.name = "王五";
st.id = 3;
someStudents.push_back(st);

std::vector<Student>::iterator pos = someStudents.begin();
for(pos; pos<someStudents.end(); ++pos)
{
cout<<pos->name<<" "<<pos->id<<endl;
}

cout<<"按照ID排序："<<endl;
std::sort(someStudents.begin(), someStudents.end(), StudentSort());
//std::sort(someStudents.begin(), someStudents.end(), sortTest);

pos = someStudents.begin();
for(pos; pos<someStudents.end(); ++pos)
{
cout<<pos->name<<" "<<pos->id<<endl;
}

return 0;
}