Minimum in the stack#4259
Implement a data structure with the next operations:
Push to the end of the structure.
Pop the last element from the structure.
Print the minimum element in the structure.
The first line contains the number of operations (1 \le n \le 10^6). Each of the next lines contains one operation. The -th line contains the number t_i — the type of operation:
in the case of a push operation;
in the case of a pop operation;
if the operation asks to find minimum;
In the case of a push operation, next comes the integer (-10^9 \le x \le 10^9) — element to be inserted into the structure. It is guaranteed that before each pop or getMin operation the structure is not empty.
For each getMin operation, print on a separate line one number — the minimal element in the structure.
1-nji mysal