Qt 结构体排序

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

typedef struct
{
	int score;
}TFileProp;

//降序
bool GreaterSort(TFileProp a, TFileProp b)
{
	return (a.score > b.score);
}

//升序
bool LessSort(TFileProp a, TFileProp b)
{
	return (a.score < b.score);
}
int main() 
{
	vector<TFileProp> VecFileProp;
	TFileProp tFileProp;
	tFileProp.score = 10;
	VecFileProp.push_back(tFileProp);
	tFileProp.score = 8;
	VecFileProp.push_back(tFileProp);
	tFileProp.score = 15;
	VecFileProp.push_back(tFileProp);
	tFileProp.score = 4;
	VecFileProp.push_back(tFileProp);

	sort(VecFileProp.begin(), VecFileProp.end(), LessSort);


	for (int i = 0; i < VecFileProp.size(); i++)
	{
		cout << VecFileProp[i].score << endl;
	}

	return 0;
}