// Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
//
// push(x) -- Push element x onto stack.
// pop() -- Removes the element on top of the stack.
// top() -- Get the top element.
// getMin() -- Retrieve the minimum element in the stack.
//
// Example:
//
// MinStack minStack = new MinStack();
// minStack.push(-2);
// minStack.push(0);
// minStack.push(-3);
// minStack.getMin();   --> Returns -3.
// minStack.pop();
// minStack.top();      --> Returns 0.
// minStack.getMin();   --> Returns -2.
//
// Your MinStack object will be instantiated and called as such:
// MinStack obj = new MinStack();
// obj.push(x);
// obj.pop();
// int param_3 = obj.top();
// int param_4 = obj.getMin();

#ifndef LEETCODECPP_MINSTACK_H
#define LEETCODECPP_MINSTACK_H

#include <stack>

namespace lcpp {

class MinStack {
public:
  MinStack() = default;

  void push(int x);

  void pop();

  int top();

  int getMin();

private:
  std::stack<int> Stack;
  std::stack<int> Min;
};

}

#endif //LEETCODECPP_MINSTACK_H
