一个简单的排序，练练手

#include <stdlib.h>
#include <iostream> 
#include <list>
#include <utility>
using namespace std;

typedef struct sortExInfo_
{
    int HuaSeNum;
    int remainNum;
}sortExInfo;

typedef pair<int, sortExInfo>  OutCardSortPair;
typedef list<OutCardSortPair>  OutCardList;


bool CardSort(OutCardSortPair& lth, OutCardSortPair& rth)
{
    if(lth.second.HuaSeNum < rth.second.HuaSeNum)
    {
        return true; 
    }

    if(lth.second.HuaSeNum > rth.second.HuaSeNum)
    {
        return false;  
    }

    if(lth.second.remainNum > rth.second.remainNum)
    {
        return false; 
    }

    return true;
}

int main(int argc, char** argv)
{
    OutCardList CardList;
    for(int i = 0; i < 20; i++)
    {
        sortExInfo sortInfo = {rand()%100, rand()%30} ; 
        OutCardSortPair CardPair(rand()%40, sortInfo); 
        CardList.push_back(CardPair);
    }

    for( OutCardList::iterator iter = CardList.begin(); iter!=CardList.end(); ++iter )
    {
        cout <<  iter->first << ","  << iter->second.HuaSeNum << "," << iter->second.remainNum << endl;
    }

    cout << "---------------------------" << endl;
    CardList.sort(CardSort);

    for( OutCardList::iterator iter = CardList.begin(); iter!=CardList.end(); ++iter )
    {
        cout <<  iter->first << ","  << iter->second.HuaSeNum << "," << iter->second.remainNum << endl;
    }

    return 0;
}