1057 Stack (30 point(s))

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
PeekMedian

where key is a positive integer no more than 105.

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

Code1:

/*
⽤排序查询的⽅法会超时～～⽤树状数组，即求第k = (s.size() + 1) / 2⼤的数。查询⼩于等于x的
数的个数是否等于k的时候⽤⼆分法更快～
*/
#include <bits/stdc++.h>
using namespace std;

string str;
int n;
vector<int> ve;
stack<int> st;
int main()
{
    cin >> n;
    while (n--)
    {
        cin >> str;
        int len = str.length();

        if (len == 3)
        {
            if (!st.size())
            {
                printf("Invalid\n");
                continue;
            }
            int temp = st.top();
            st.pop();
            ve.erase(lower_bound(ve.begin(), ve.end(), temp));
            printf("%d\n", temp);
        }

        else if (len == 10)
        {
            if (!st.size())
            {
                printf("Invalid\n");
                continue;
            }
            int L = st.size();
            printf("%d\n", ve[(L + 1) / 2 - 1]);
        }

        else
        {
            int m;
            scanf("%d", &m);
            st.push(m);
            ve.insert(lower_bound(ve.begin(), ve.end(), m), m);
        }
    }

    return 0;
}

Code2:

//待补充