Description
I have broken many girls' hearts into pieces. But none of them mad at me. None.
~ by anonymous surgeon
You're a surgeon, you need to mend those girls' hearts. Therefore you need a data structure to support some functions.
This question is about maintain a set that contains only integers.
There will be n instructions.
Each instruction will be either:
insert:
Insert a new element ai into the set. Note that if the element has already in the set, do nothing.
print:
print all the element in the set in increasing order.
min:
print the number in the set that is the smallest. If there's no number, do nothing.
range_erase:
You will have two integer l, r.
You need to erase all the elements ai in the set that l <= ai <= r
Hint: You can solve this question very fast by using std::set .
These are some functions you may use in your code:
set.begin(), set.size(), set.erase(), set.lower_bound(), set.upper_bound(), set.insert(). To traverse through your set, you may also need iterator or type auto(only in c++11!)
You can also solve this question in C.
Input
the input will contain several lines.
The first line only contains an integer n (1 <= n <= 5000)
The following are n lines.
Each lines contains a instruction list above.
Note that ai (0 <= ai <= 10^9)
Output
For each print instruction, print all the number in the set in increasing order.
Each number is separated by a single blank.(No blank at the the end!)
Remember to print \n at the end of output
For each min instruction, print the smallest number in the set.
Remember to print \n at the end of output