C++ , use only Abstract DS

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 2 3 1* -Push the element x into the stack. -Delete the element present at the top of the stack. -Print the maximum element in the stack. Input Format The first line of input contains an integer, N. The next N lines each contain an above mentioned query. (It is guaranteed that each query is valid.) Constraints 1<>