Fish

public static int (int[] A, int[] B) {
    
    int size = A.length, cnt = size;
    int winner = 0; // index of winner
    Stack<Integer> stack = new Stack<Integer>();

    for(int i=0;i<size-1;i++){
        if(B[winner] == 1){
            if(B[i+1] == 0){
                // decide winner
                while(A[winner]<A[i+1]){
                    if(stack.size() > 0)
                        winner = stack.pop();
                    else
                        winner = i+1;
                    cnt--;
                }
                if(A[winner]>A[i+1])
                    cnt--;
            }else{
                stack.push(winner);
                winner = i+1;
            }
        }else
            winner++;
    }
    return cnt;
}