两个有序数组的第n大数「建议收藏」

int getmid(int a[],int b[],int n)
{
	int k=0;
	int i=0,j=0;
	while(i<n&&j<n)
	{
		if(a[i]<b[j])
		{
			i++;
			k++;
			if(k==n)
				return a[i-1];
		}
		else 
		{
			j++;
			k++;
			if(k==n)
				return b[j-1];
		}
	}
}

# include <iostream>
# include <cstdlib>
using namespace std;

int mid(int a[],int b[],int n)
{
	int s1=0,e1=n-1;
	int s2=0,e2=n-1;
	int mid1=(s1+e1)/2;
	int mid2=(s2+e2)/2;
	while(s1!=e1||s2!=e2)
	{
		mid1=(s1+e1)/2;
		mid2=(s2+e2)/2;
		if(a[mid1]==b[mid2])
		{
			return a[mid1];
		}
		if(a[mid1]<b[mid2])
		{
			if((s1+e1)%2==0)
			{
				s1=mid1;
				e2=mid2;
			}
			else 
			{
				s1=mid1+1;
				e2=mid2;
			}
		}
		else
		{
			if((s1+e1)%2==0)
			{
				e1=mid1;
				s2=mid2;
			}
			else
			{
				e1=mid1;
				s2=mid2+1;
			}
		}
	}
	return a[s1]<b[s2]?a[s1]:b[s2];}int main(){	int a[5]={2,4,5,6,9};	int b[5]={1,3,7,8,10};	cout<<mid(a,b,5)<<endl;	system("pause");	return 0;}