最小栈

#include
#include
using namespace std;
class Min_Stack {
public:
stack s1;
stack s2;
void minstack(int n) {
if (s2.empty() == 1) s2.push(n);
if (n < s2.top()) s2.push(n);
s1.push(n);
}
};
int main() {
Min_Stack m1;
int n = 0;
while (cin >> n) {
m1.minstack(n);
cout << m1.s1.top() << " " << m1.s2.top();
}
return 0;
}