PAT A 1029 Median

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

int main()
{
    int len1,len2;
    cin>>len1;
    int a[len1];
    for(int i=0;i<len1;i++) scanf("%d",&a[i]);
    cin>>len2;
    int b[len2];
    for(int i=0;i<len2;i++) scanf("%d",&b[i]);
    int ans,index=0,mid=(len1+len2+1)/2;
    int i=0,j=0;
    while(i<len1&&j<len2){
        if(a[i]<=b[j])  ans=a[i++];
        else            ans=b[j++];
        index++;
        if(index==mid)  break;
    }
    while(i<len1&&index!=mid){
        ans=a[i++];
        index++;
    }
    while(j<len2&&index!=mid){
        ans=b[j++];
        index++;
    }
    cout<<ans<<endl;
    return 0;
}