Files

26 lines
598 B
C++

#include <iostream>
#include<queue>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, op, u;
std::cin >> n;
while (std::cin >> n) {
std::priority_queue<int, std::vector<int>, std::greater<>> priority_queue;
for (int _ = 0; _ < n; _++) {
std::cin >> op;
if (op == 1) {
std::cin >> u;
priority_queue.push(u);
} else {
std::cout << priority_queue.top() << std::endl;
priority_queue.pop();
}
}
}
return 0;
}