1029 Median

1029 Median

#include<iostream>
#include<algorithm>
using namespace std;
const int N=2e5+10;
int w1[N],w2[N];

int main(){
    int n1,n2;
    cin>>n1;
    for(int i=0;i<n1;i++) scanf("%d",&w1[i]);
    cin>>n2;
    for(int i=0;i<n2;i++) scanf("%d",&w2[i]);
    
    int p1=0,p2=0,p=0,tar=(n1+n2-1)>>1;
    while(p1<n1&&p2<n2){
        if(w1[p1]<w2[p2]){
            if(p==tar){
                cout<<w1[p1];return 0;
            }
            p1++;p++;
        }
        else{
            if(p==tar){
                cout<<w2[p2];return 0;
            }
            p2++;p++;       
        }
    }
    if(p1<n1) cout<<w1[tar-p+p1];
    else cout<<w2[tar-p+p2];
    return 0;
}