class MinStack {
public:
    int s[int(3e4)];
    int m[int(3e4)];
    int Size = 0;

    MinStack() {
    }
    
    void push(int val) {
        s[Size] = val;
        if (!Size) m[Size] = val;
        else m[Size] = val < m[Size-1] ? val : m[Size-1];
        Size++;
    }
    
    void pop() {
        Size--;
    }
    
    int top() {
        return s[Size-1];
    }
    
    int getMin() {
        return m[Size-1];
    }
};

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack* obj = new MinStack();
 * obj->push(val);
 * obj->pop();
 * int param_3 = obj->top();
 * int param_4 = obj->getMin();
 */