C++

Poker Icy likes to play poker. Recently she came up with a new trick about poker. She allows her friend to add or remove poker cards from the top of the pile. And she thinks that with the help of computer program, she will be capable of telling her friend the largest value in the current pile of cards instantly. All the operations are done on the top of pile. Could you help Icy to write such a program? Initially there is no card in the pile and we denote each card by a distinct integer ranging from 1 to 100,000,000 Input The input contains multiple test cases. The first line of input is an integer T (1T100) representing the number of test cases. For each test case the first line gives an integer n showing the number of cards to be added to the empty pile at the beginning. The following line gives n integers representing cards to be added. Then, the next line contains an integer m indicating the number of operations and there will be m lines followed where each line gives the operation in the format: (1) m: (max operation) query the largest value in the current pile (2)r: (remove operation) remove the card at the top (3) a i: (add operation) add a card with value i to the pile It is guaranteed that 1