题解 | Median

//KY143 Median
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int n, m;
int s1[1000005], s2[1000005];
int main()
{
    while(cin>>n){
        for(int i=1;i<=n;i++) cin>>s1[i];
        cin>>m;
        for(int j=1;j<=m;j++) cin>>s2[j];
        int mid=(m+n+1)/2;
        int l1=1, l2=1, ans=0;
        for(int i=1;i<=mid;i++){
            if(s1[l1]<s2[l2]) ans=s1[l1++];
            else ans=s2[l2++];
        }
        cout<<ans<<'\n';
    }
    return 0;
}