题解 | #复数集合#

#include<iostream>
#include<queue>
#include<string>
using namespace std;

struct comp{
  int real;
  int imag;
  comp(int a,int b):real(a),imag(b){}
  bool operator <(comp 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<comp> myqueue;
    while(n--){
      string str;
      cin>>str;
      if(str=="Pop"){
        if(myqueue.empty())printf("empty\n");
        else{
          printf("%d+i%d\n",myqueue.top().real,myqueue.top().imag);
          myqueue.pop();
          printf("SIZE = %d\n",myqueue.size());
        }
      }
      else{
        int a,b;
        scanf("%d+i%d",&a,&b);
        myqueue.push(comp(a,b));
        printf("SIZE = %d\n",myqueue.size());
      }
    }
  }
   

  return 0;
}