#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
struct feas {
std::string name;
float num;
};
bool cmp_num(const feas &p1, const feas &p2) {
return p1.num > p2.num;
}
int main(int argc, char** argv)
{
vector<feas> fs;
feas temp;
float ft = 0.00;
for (int i = 0; i < 100; i++) {
ft = (float)(ft + 0.01);
temp.name = "ifcimg";
temp.num = (float)(1.00 + ft);
fs.push_back(temp);
}
sort(fs.begin(), fs.end(), cmp_num);
for (int i = 0; i < fs.size(); i++) {
cout << fs[i].num << endl;
}
getchar();
return 0;
}
按照结构体float 排序如果是从小到大排序 改成 p1.num < p2.num就可以了