had to research to get the full 100

Fish codility lesson 5

import java.util.Stack;
class Solution {
    public int solution(int[] A, int[] B) {
        // write your code in Java SE 8
        Stack<Integer> upStack=new Stack<Integer>();        
        Stack<Integer> downStack=new Stack<Integer>();
        for(int index=0;index<A.length;index++){
            if(B[index]==0){
               
                  while(!downStack.empty()&&downStack.peek()<A[index]){
                      downStack.pop();
                  }
                   if(downStack.empty()){
                 upStack.push(A[index]) ;  
                }
                
            }else{
                downStack.push(A[index]);
            }
        }
        return upStack.size()+downStack.size();
    }
}