1029 Median (25分)

#include<iostream>
#include<cstdio>

using namespace std;

const int N = 200010;

int cnt;
int n, m;
long a[N], b[N];

int main(){
    scanf("%d", &n);
    for(int i = 0; i < n; i ++) scanf("%ld", &a[i]);
    
    scanf("%d", &m);
    for(int i = 0; i < m; i ++) scanf("%ld", &b[i]);
    
    long res;
    int i = 0, j = 0, cnt = n + m + 1 >> 1;
    
    while(cnt --){
        if(i < n) res = a[i];
        if(j < m && (i >= n || b[j] <= a[i])) res = b[j ++];
        else i ++;
    }
    
    cout << res;
    
    return 0;
}