stl list sort从大到小排序(转载)

#include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <string>

using namespace std;

class Salesperson
{
public:
Salesperson( const string& name = "", int sales = 0,int district = 0 );
bool operator>( const Salesperson& rhs ) const;
void print() const;

private:
int district_;
string name_;
int sales_;
};

inline Salesperson::Salesperson( const string& name, int sales, int district ): district_( district ), name_( name ), sales_( sales )
{

}

inline bool Salesperson::operator>( const Salesperson& rhs ) const
{
return sales_ > rhs.sales_;
}

inline void Salesperson::print() const
{
cout<<name_ << " from District " << district_<< " has sales of $" << sales_ << endl;
}

int main( )
{
list<Salesperson> list1;
list1.push_back( Salesperson( "A", 37000, 1 ) );
list1.push_back( Salesperson( "B", 49000, 1 ) );
list1.push_back( Salesperson( "C", 48500, 1 ) );

// sort District 1 salespeople in descending order and display
list1.sort( greater<Salesperson>() );
for_each( list1.begin(), list1.end(), mem_fun_ref( &Salesperson::print ) );
}

 

引用:http://www.java2s.com/

转载于:https://www.cnblogs.com/wghost/archive/2012/09/27/2705854.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值