C++ - Stack - 自制栈 - 简易版

#include <bits/stdc++.h>
using namespace std;
typedef int type;
class Stack
{
    protected:
    const int big = 10000;
    type data[10010];
    int t = 0;
    public:
    void push(type x)
    {
        if (t >= big)
        {
            cout << "StackError:Overflow" << endl;
            return;
        }
        data[++t] = x;
    }
    type top()
    {
        return data[t];
    }
    void pop()
    {
        if (t <= 0)
        {
            cout << "StackError:Underflow" << endl;
            return;
        }