stl List 容器和排序

#include "stdafx.h"
#include
#include
#include
#include
#include

using namespace std;


class Point
{
public:
float x,y;
float R;
};

struct Compare
{
float R;

bool operator () (Point current_pt) const
{
return current_pt.R <> pt2.R;
}
};

int _tmain(int argc, _TCHAR* argv[])
{
int i,j,k;

std::string file="c:/site.txt";
std::ifstream infile(file.c_str(),std::ofstream::in);//默认模式



Compare cmp;
cmp.R = 10; //指定学号

CompareSort comps;

list ptVec;

Point pt;
pt.R = 11;

ptVec.push_back(pt);

pt.R = 20;
ptVec.push_back(pt);

pt.R = 2;
ptVec.push_back(pt);

pt.R = 0;
ptVec.push_back(pt);

pt.R = 120;
ptVec.push_back(pt);

// vector::const_iterator iter = find_if(ptVec.begin(), ptVec.end(), cmp);

// std::cout<<>R<<"\n"; ptVec.sort( comps); for (list::const_iterator c_iter = ptVec.begin();
c_iter != ptVec.end();
++c_iter)
{
cout <<>R << " "<
}





return 0;
}