PAT（甲级）1029. Median (25)

题目：https://www.patest.cn/contests/pat-a-practise/1029

代码：#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main()
{
int n1,n2;
int a[1000010],b[1000010];
scanf("%d",&n1);
for(int i=0;i<n1;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&n2);
for(int i=0;i<n2;i++)
{
scanf("%d",&b[i]);
}
a[n1]=b[n2]=0x7fffffff;
int median=(n1+n2-1)/2;
int i=0,j=0,count=0;
while(count<median){
if(a[i]<b[j]) i++;
else j++;
count++;
}
if(a[i]<b[j]){
printf("%d\n",a[i]);
}else{
printf("%d\n",b[j]);
}

system("pause");
}