A1029 Median (25 分)

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
int N1, N2;
int a[200010], temp;
const int inf = (1<<31) - 10;
int main(){	
	scanf("%d", &N1);
	for(int i = 0; i < N1; i++){
		scanf("%d", &a[i]);
	}a[N1] = inf;
	scanf("%d", &N2);
	int pos = (N1+N2-1)/2, med;
	int p1 = 0, p2 = 0, p = -1, flag = 0;;
	for(p2 = 0; p2 < N2; p2++){
		scanf("%d", &temp);
		if(flag) continue;
		while(a[p1] <= temp && p < pos){
			med = a[p1++]; ++p;
		}
		if(p < pos){
			med = temp; ++p;
		}
		if(p == pos) flag = 1;		
	}
	if(!flag){
		while(p < pos){
			med = a[p1++];
			++p;
		}	
	}
	printf("%d\n", med);
	return 0;	
}