C++ sort自定义排序

#include <iostream>     // std::cout
#include <algorithm>    // std::sort
#include <vector>       // std::vector

bool myfunction (int i,int j) { return (i<j); }

struct myclass {
  bool operator() (int i,int j) { return (i<j);}
} myobject;

int main () {
  int myints[] = {32,71,12,45,26,80,53,33};
  std::vector<int> myvector (myints, myints+8);               // 32 71 12 45 26 80 53 33

  // using default comparison (operator <):
  std::sort (myvector.begin(), myvector.begin()+4);           //(12 32 45 71)26 80 53 33

  // using function as comp
  std::sort (myvector.begin()+4, myvector.end(), myfunction); // 12 32 45 71(26 33 53 80)

  // using object as comp
  std::sort (myvector.begin(), myvector.end(), myobject);     //(12 26 32 33 45 53 71 80)

  // print out content:
  std::cout << "myvector contains:";
  for (std::vector<int>::iterator it=myvector.begin(); it!=myvector.end(); ++it)
    std::cout << ' ' << *it;
  std::cout << '\n';

  return 0;
}

还有这种：

class Edge
{
public:
	int src;		//起始顶点 
	int dest; 		//目标顶点 
	int weight;		//权重
	Edge(int _src, int _dest, int _weight)
	{
		src = _src;
		dest = _dest;
		weight = _weight;
	}
	Edge():src(0),dest(0),weight(0){}
	bool operator < (const Edge &b) const
	{
		return weight < b.weight;       //升序
	} 
};

调用：

	vector<Edge> edge;
	.....往edge加若干个元素之后.....
	sort(edge.begin(), edge.end());