111qqz的小窝

老年咸鱼冲锋!

2015 多校 #5 1007 MZL’s simple problem

MZL’s simple problem

Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2541    Accepted Submission(s): 694

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 (N106),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 109.
 

 

Output
For each operation 3,output a line representing the answer.
 

 

Sample Input
6
1 2
1 3
3
1 3
1 4
3
 

 

Sample Output
3
4
 
水题。
模拟就好。

话说puts() 不是挺快的。。。

结果还tle了一次。
然后改成 printf 就A了。。。

View Code

 

说点什么

您将是第一位评论人!

提醒
wpDiscuz
粤ICP备18103363