优先队列与贪心

//优先队列模版

#include<bits/stdc++.h>
using namespace std;
priority_queue<pair<int,int>> q;
priority_queue<string,vector<string>,greater<string> > p;
struct AC{
    int x,y;
    bool operator < (AC a)const{
        if(y==a.y)return x>a.x;
        return y<a.y;
    }
    AC operator + (AC a)const{
        AC ret;
        ret.x=x^a.y;
        ret.y=y^a.x;
        return ret;
    }
};
priority_queue<AC> qq;
signed main(){
    q.push(make_pair(1,5));
    q.push(make_pair(2,3));
    q.push(make_pair(3,1));
    q.push(make_pair(3,4));
    for(int i=1;i<=4;i++){
        // printf("%d %d\n",q.top().first,q.top().second);
        q.pop();
    }
    p.push("ababba");
    p.push("babbab");
    for(int i=1;i<=2;i++){
        // cout<<p.top()<<endl;
        p.pop();
    }
    AC aa;aa.x=1;aa.y=5;
    qq.push(aa);
    qq.push(AC{2,3});
    qq.push(AC{3,1});
    qq.push(AC{3,4});
    for(int i=1;i<=4;i++){
        printf("%d %d\n",qq.top().x,qq.top().y);
        qq.pop();
    }
    AC a,b,c;
    a=AC{1,2};b=AC{3,4};
    c=a+b;
    printf("%d %d\n",c.x,c.y);
}
/*

1 1 1 1 1 2

2 2 2 2 2 100000



1 25 1 1

1 60 55 1


n val_i weg_i m



*/