C++ STL中的set如何对自定义类对象排序?


#include <iostream>
#include <set>
#include <string>
using namespace std;
struct Word
{
string str;
int prob;
Word( string s, int i):str(s),prob(i){};
Word(){};
};
struct MapCmp
{
bool operator()(const Word s1, const Word s2) const
{
if( s1.prob != s2.prob )
return s1.prob > s2.prob;
return s1.str.compare(s2.str) > 0;
}
};
typedef multiset<Word, MapCmp> Mapwords;
Mapwords words;
int main()
{
words.insert(Word("hello",1));
words.insert(Word("hell",1));
words.insert(Word("hell",2));
words.insert(Word("third",3));
words.insert(Word("ok",3));
words.insert(Word("jjjj",-2));
Mapwords::iterator mbegin;
Mapwords::iterator mend = words.end();
for( mbegin = words.begin(); mbegin != mend; ++mbegin)
cout<<mbegin->str<<'\t'<<mbegin->prob<<endl;
getchar();
return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值