方法一：通过定义排序函数cmp（）来实现，类似对结构体的排序。 #include<vector> #include<string> #include <iostream> #include <algorithm> using namespace std;
//这种排序方法，类似结构体的排序 int my_cmp(pair<string,int> p1,pair<string,int> p2) { return p1.second > p2.second; } int main(int argc,char* argv) { vector<pair<string,int> > m_vector;
m_vector.push_back(make_pair("a",1)); m_vector.push_back(make_pair("c",3)); m_vector.push_back(make_pair("b",2)); sort(m_vector.begin(),m_vector.end(),my_cmp); cout << m_vector[0].first<< " " << m_vector[1].first << " " << m_vector[2].first << std::endl; } 方法二：通过对运算符的重载，实现对vector的排序 #include<vector>
#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
typedef struct ValuePerWeight //定义结构体
{
double vw;
int i;
//升序排序，对小于号重载
bool operator <(const ValuePerWeight &other)const
{
return vw>other.vw;
}
//降序排序，对大于号重载
bool operator >(const ValuePerWeight &other)const
{
return vw>other.vw;
}
} ValuePerWeight;
int main()
{
vector<ValuePerWeight> vpw ;
sort(vpw.begin(), vpw.end(),greater<ValuePerWeight>());//升序
sort(vpw.begin(), vpw.end(),less<ValuePerWeight>());//降序
return 0;
}