double find_kth(int a[],int m,int b[],int n,int k){ if(m>n) return find_kth(b,n,a,m,k); if(m==0) return b[k⑴]; if(k==1) return min(a[0],b[0]); int pa=min(k/2,m),pb=k-pa; if(a[pa⑴]<b[pb⑴]) return find_kth(a+pa,m-pa,b,n,k-pa); else if(a[pa⑴]>b[pb⑴]) return find_kth(a,m,b+pb,n-pb,k-pb); else return a[pa⑴]; } class Solution { public: double findMedianSortedArrays(int A[], int m, int B[], int n) { int sum=m+n; if(sum%2){ return find_kth(A,m,B,n,sum/2+1); } else return (find_kth(A,m,B,n,sum/2)+find_kth(A,m,B,n,sum/2+1))/2; } };