MultiSet链表自定义结构体排序

STL越用越上手,刚刚刷HDU遇到一道需要排序的自定义结构体的题目(HDU1434)

#include 
#include <set>
using namespace std;

struct P
{
    int rp;
    char name[32];
    P()
    {
        this->rp=0;
        memset(this->name,0,sizeof(this->name));
    }
};

struct compare
{
     bool operator () (P p1,P p2)
    {
        if(p1.rp==p2.rp)
        {
            return strcmp(p1.name,p2.name)<0;
        }
        else
        {
            return p1.rp>p2.rp;
        }
    }
};

int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        multiset h[10001];
        for(int i=1;i<=n;i++)
        {
            int j;
            scanf("%d",&j);
            while(j--)
            {
                P tmp;
                scanf("%s%d",tmp.name,&tmp.rp);
                h[i].insert(tmp);
            }
        }
        
        for(int i=0;i)
        {
            int x,y;
            P tmp;
            char action[8]={0};
            
            scanf("%s",action);
            switch(action[4])
            {
                case 'U':
                {
                    scanf("%d%*c",&x);
                    //multiset::reverse_iterator riter=h[x].rbegin();
                    //printf("%s\n",(*riter).name);
                    //multiset::iterator iter(riter.base());
                    multiset::iterator iter=h[x].begin(),ans;

                    while(iter!=h[x].end())
                    {
                        ans=iter;
                        iter++;
                    }
                    printf("%s\n",(*ans).name);
                    h[x].erase(ans);
                    break;
                }
                case 'N':
                {
                    scanf("%d%s%d%*c",&x,tmp.name,&tmp.rp);
                    h[x].insert(tmp);
                    break;
                }
                default://join
                {
                    int y;
                    scanf("%d%d%*c",&x,&y);
                    for(multiset::iterator iter=h[y].begin();iter!=h[y].end();iter++)
                    {
                        h[x].insert(*iter);
                    }
                    h[y].clear();
                    break;
                }
            }
        }
        
        
    }
    return 0;
}

转载于:https://www.cnblogs.com/eslizn/archive/2012/09/24/2700455.html