PAT真题练习（甲级）1057 Stack (30 分) （使用multiset和stack实现）

PAT真题练习（甲级）1057 Stack (30 分)

原题网址：https://pintia.cn/problem-sets/994805342720868352/problems/994805417945710592

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 (≤10⁵). Then N lines follow, each contains a command in one of the following 3 formats:

Push key
Pop
PeekMedian

where key is a positive integer no more than 10⁵.
​​ .

Output Specification:

For each Push command, insert key into the stack and output nothing. For each Pop or PeekMedian command, print in a line the corresponding returned value. If the command is invalid, print Invalid instead.

Sample Input :

17
Pop
PeekMedian
Push 3
PeekMedian
Push 2
PeekMedian
Push 1
PeekMedian
Pop
Pop
Push 5
Push 4
PeekMedian
Pop
Pop
Pop
Pop

Sample Output :

Invalid
Invalid
3
2
2
1
2
4
4
5
3
Invalid

思路 :

本题我采用的是二分的方法，即通过一个stack和两个multiset来进行存储。
stack：进行push pop的基本操作
multiset： 用于更新median的数值
left_set ： 用于存储小于等于median的数
right_set：用于存储大于等于median的数
注意：时刻保持left_set.size() >= right_set.size() 且差值不超过1

在实际的实现过程中碰到了挺多易错点的，下面列举一些：

1. 注意不要使用set，避免忽略掉相同的数
2. 使用erase函数对set中的数进行删除的时候要注意，如果直接erase(number) ，那么如果有多个这个值的数则会被同时删除。正确的方式应该改使用erase(iter) 比如 erase(multiset.find(number))
3. 注意size_t 的数据类型相减时，得到负数会溢出
4. 在Pop更新median的时候，注意数列为空的时候，避免发生访问段错误

AC代码

#include <stdio.h>
#include <iostream>
#include <stack>
#include<