复数集合（优先队列、二叉堆）

#include <iostream>
#include <queue>
using namespace std;
struct Complex{
    int real,imag;
    Complex(int a,int b):real(a),imag(b){}   //构造函数
    bool operator <(Complex c) const{       //重载小于号
        if(real*real+imag*imag==c.real*c.real+c.imag+c.imag) return imag>c.imag;  //这个时候小于号成立
        else return real*real+imag*imag<c.real*c.real+c.imag+c.imag;
    }
};
int main() {
    int n;
    while (scanf("%d",&n)!=EOF){
        priority_queue<Complex> MypriorityQueue;
        while(n--){
            string str;
            cin>>str;
            if(str=="Pop"){
                if(MypriorityQueue.empty()) printf("empty\n");
                else {
                    Complex current=MypriorityQueue.top();
                    MypriorityQueue.pop();
                    printf("%d+i%d\n",current.real,current.imag);
                    printf("SIZE=%d\n",MypriorityQueue.size());
                }
            }else{
                int a,b;
                scanf("%d+i%d",&a,&b);
                MypriorityQueue.push(Complex(a,b));
                printf("SIZE=%d\n",MypriorityQueue.size());
            }         
        }
    }
    system("pause");
    return 0;
}