Stack (30)

最新推荐文章于 2022-06-01 11:09:46 发布

BlackCarDriver

最新推荐文章于 2022-06-01 11:09:46 发布

阅读量472

点赞数

分类专栏： PAT 文章标签： Stack(30)

本文链接：https://blog.csdn.net/blackcardriver/article/details/95672737

版权

这篇博客讨论了Stack这一基本数据结构，强调了其Last In First Out (LIFO)原则。文章介绍了一个额外的操作：PeekMedian，用于返回栈中所有元素的中位数。对于给定的输入，包括Push、Pop和PeekMedian命令，博客提供了相应的输出逻辑。当命令无效时，输出'Invalid'。实现的关键是维护两个堆，确保任何时候第一个堆的大小不超过第二个堆一个，以快速获取中位数。

摘要由CSDN通过智能技术生成

Stack (30)
难度： ⭐⭐⭐⭐

题目连接
题目描述
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.

输入描述:
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
PeekMedian
where key is a positive integer no more than 105.

输出描述:
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.

输入例子:
17
Pop
PeekMedian
Push 3
PeekMedian
Push 2
PeekMedian
Push 1
PeekMedian
Pop
Pop
Push 5
Push 4
PeekMedian
Pop
Pop
Pop
Pop

输出例子:
Invalid
Invalid
3
2
2
1
2
4
4
5
3
Invalid

大意
给出三种操作：在栈的基础功能上再增加一个要求，能在任何时候够高效地取出栈里面大小排在中间的那个数。

分析
主要的难点是做一个能够随时取出中位数的数据结构，可以维护两个堆，使得任何时候第一个堆的大小不比第二个多于一，那么第一个堆的最大元素就是所需要的中位数。

MYCODE

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<string>
#include<set>
#include<stack>
using namespace std;
class Myset{
   
	multiset<int> s1, s2;
public