PAT甲题题解-1029. Median (25)-求两序列的中位数，水的不要不要的

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <cmath>
#include <queue>
using namespace std;
/*
水死了
*/
const int maxn=2000000+5;
int seq[maxn];

int main()
{
int n1,n2;
scanf("%d",&n1);
for(int i=0;i<n1;i++){
scanf("%d",&seq[i]);
}
scanf("%d",&n2);
for(int i=0;i<n2;i++){
scanf("%d",&seq[n1+i]);
}
sort(seq,seq+n1+n2);
int n=n1+n2;
int mid;
if(n%2==0){
mid=n/2;
}
else{
mid=n/2+1;
}
printf("%d\n",seq[mid-1]);
return 0;
}