容器中數據類型爲結構體時對其進行排序

#include <iostream>
#include <vector>
#include <algorithm> 
using namespace std;
struct DataDistance
{
	int		piclabel;			//圖像標籤
	double	picdist;			//圖像間距離
};
bool cmp1(const DataDistance &a,const DataDistance &b)  
{  
	return(b.picdist<a.picdist);  
} 
int main()
{
	vector<DataDistance> dis;
	DataDistance dd;
	for (int i=1;i<10;i++)
	{
		dd.piclabel=i;
		dd.picdist=i+1;
		dis.push_back(dd);
	}
	dis[3].picdist=12;
	dis[3].piclabel=2;
	
	sort(dis.begin(),dis.end(),cmp1);
	for (int i=0;i<dis.size();i++)
	{
		cout<<dis[i].piclabel<<","<<dis[i].picdist<<endl;
	}
	return 0;
}