155.cpp

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<stack>
using namespace std;

class MinStack {
public:
    /** initialize your data structure here. */
	stack<int> s;
	stack<int> min;
    MinStack() {
        
    }
    
    void push(int x) {
		s.push(x);
		if(min.empty()||min.top()>=x)	//°Ñ¸üСµÄ·Å½øminÀï
			min.push(x);
    }
    
    void pop() {
		if(s.top()==min.top())
		{
			s.pop();
			min.pop();
		}
		else s.pop();
    }
    
    int top() {
		return s.top();
    }
    
    int getMin() {
		return min.top();
    }
};

/**
 * 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();
 */