1057. Stack (30)-PAT甲级真题（树状数组）

原创

已于 2023-11-09 17:26:16 修改 · 4.4k 阅读

7 ·

CC 4.0 BY-SA版权

文章标签：

#PAT

于 2016-08-17 15:30:03 首次发布

Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push (inserting an element onto the top position) and Pop (deleting the top element). Now you are supposed to implement a stack with an extra operation: PeekMedian -- return the median value of all the elements in the stack. With N elements, the median value is defined to be the (N/2)-th smallest element if N is even, or ((N+1)/2)-th if N is odd.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (<= 105). Then N lines follow, each contains a command in one of the following 3 formats:

Push key
Pop</