#include
using namespace std;
// define size for array
const int size = 20;
// function declare to the problem
int Super_bisearch(int * A,const int Asize,int * B,const int Bsize,const int k);
// function declare to binary search
int Bisearch(int *d,int length,int key );
// function main
int main()
{
int * A = new int[size];
int * B = new int[size];
for(int i = 0;i<> (Asize+Bsize))
{
cout<<"exception of input super_bisearch"< 2 &&(sa ( ca + cb - sa - sb) )
{
number = number - ( ca + cb - sa - sb );
sa = ca;
sb = cb;
if( ( ca + cb - sa - sb ) == 0) break;
}
else if( ( ca + cb - sa - sb) == number )
{
return A[ca]>B[cb]?A[ca]:B[cb];
}
else if( number < ( ca + cb - sa - sb) )
{
ba = ca;
bb = cb;
}
}
int * d = new int[ba-sa+1+bb-sb+1];
int i = sa,j = sb,bit = 0;
while(i <= ba && j <= bb)
{
if(A[i] d[c] )
{
s = c;
if( e-s == 1 && d[s]