CC150:3.2

import java.util.Stack;


public class StackWithMin  extends Stack<Integer>{

Stack<Integer> s2;
public 	StackWithMin(){
	s2=new Stack<Integer>();
	}
public void push(int value){
	if(value<=min()){
		s2.push(value);
	}
	super.push(value);
	}
public Integer pop(){
	int value=super.pop();
	if(value==min()){
		s2.pop();
	}
	return value;
}
public int min(){
	if(s2.isEmpty()){
		return Integer.MAX_VALUE;
		}
	else{
		return s2.peek();
	}
}
public static void main(String[] args) {
StackWithMin stack = new StackWithMin();
for(int i = 0; i < 10; i++) {
stack.push(10 - i);
}
while(!stack.isEmpty()) {
System.out.println("current min elem is " + stack.min());
System.out.println("top elem is " + stack.pop());
}
}
}