A1029. Median (25)

#include<cstdio>
#include<algorithm>

using namespace std;

const long long inf = 0x7fffffff;
const int maxn = 1000001;
long long a[maxn],b[maxn];<span style="white-space:pre">		</span>//大数组定义在main外
int main(){
int n1,n2;
long long max;
scanf("%d",&n1);
for(int i = 0;i < n1;i++)
scanf("%lld",&a[i]);
//sort(a,a+n1);<span style="white-space:pre">		</span>不需要排序？
scanf("%d",&n2);
for(int i = 0;i < n2;i++)
scanf("%lld",&b[i]);
//sort(b,b+n2);
a[n1] = inf;<span style="white-space:pre">	</span>//这个必须有
b[n2] = inf;
int mid = (n1+n2-1)/2;
int i = 0,j = 0;
while(i+j<mid){		//向前推进
if(a[i]<=b[j]) i++;
else  j++;
}
max = a[i]<b[j]?a[i]:b[j];
printf("%lld\n",max);
return 0;
}