1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream>
#include<queue>
using namespace std;
int main()
{
    priority_queue<int> pq;
    int N;
    cin>>N;
    //fflush(stdin);
    char f;
    int w;
    for(int i=0;i<N;i++){
        cin>>f;
        if(f=='A'){
            cin>>w;
            pq.push(w);
        }
        else{
            if(pq.empty()) break;
            cout<<pq.top()<<endl;
            pq.pop();
        }
    }
    
    return 0;
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX