设X[0:n-1]和Y[0:n-1]为两个数组，每个数组中含有n个已排好序的数组，试设计一个O(logn)时间的算法，找出X和Y的2n个数的中位数。

import java.util.Scanner;

import javax.swing.text.AbstractDocument.BranchElement;

public class erfensousuo {
public static void main(String[] args) {

	Scanner sc=new Scanner(System.in);
	int n = sc.nextInt();
	
	int []a=new int[n];
	int []b=new int[n];
	
	
	  for(int i = 0;i<a.length; i ++ ){           
	              a[i] = sc.nextInt();  
	             
	  }
	  
	  for(int i= 0;i<b.length; i++ ){           
	              b[i] = sc.nextInt(); 
	              }
	 
	 	


	int left=0;int right=n-1;
	int xleft=0;int xright=n-1;
	
	float middle1;
	float middle2;
			if((right-left+1)%2==0){
				middle1=(float)(a[(right-left+1)/2-1]+a[(right-left+1)/2])/2;
				middle2=(float)(b[(xright-xleft+1)/2-1]+b[(xright-xleft+1)/2])/2;
			}else{
				middle1=a[(right-left+1)/2];
				middle2=b[(xright-xleft+1)/2];
				
			}
			
			
			
			
		
		if(middle1=&