|
||||||||||
MZL's simple problemTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3912 Accepted Submission(s): 1357 Problem Description A simple problem Problem Description You have a multiple set,and now there are three kinds of operations: 1 x : add number x to set 2 : delete the minimum number (if the set is empty now,then ignore it) 3 : query the maximum number (if the set is empty now,the answer is 0) Input The first line contains a number $N$ ($N\leq 10^6$),representing the number of operations. Next $N$ line ,each line contains one or two numbers,describe one operation. The number in this set is not greater than $10^9$. Output For each operation 3,output a line representing the answer. Sample Input
Sample Output
Author SXYZ Source | ||||||||||
|