# 1029 Median （25 分）

Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequences is defined to be the median of the nondecreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.

Given two increasing sequences of integers, you are asked to find their median.

### Input Specification:

Each input file contains one test case. Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤2×10​5​​) is the size of that sequence. Then N integers follow, separated by a space. It is guaranteed that all the integers are in the range of long int.

### Output Specification:

For each test case you should output the median of the two given sequences in a line.

### Sample Input:

4 11 12 13 14
5 9 10 15 16 17


### Sample Output:

13

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 200010;
int A[maxn], B[maxn];

int main(){
int n, m;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &A[i]);
}
scanf("%d", &m);
for (int j = 1; j <= m; ++j) {
scanf("%d", &B[j]);
}
sort(A + 1, A + n +1);
sort(B + 1, B + m +1);

long int sum = n + m;
if(sum % 2 == 0){
sum /= 2;
}else{
sum = sum / 2 + 1;
}
// printf("%d", sum);
int i = 1,j = 1;
long int index = 1;
bool flag1 = false;
while(i <= n && j <= m){
if(A[i] > B[j]){
//targe[index++] = B[j++];
j++;
index++;
if(index  == sum){
flag1 = true;
break;
}
}else{
//targe[index++] = A[i++];
i++;
index++;
if(index == sum) break;
}
}
while(i <= n && index != sum){
//targe[index++] = A[i++];
i++;
index++;
if(index  == sum) {
break;
}
}
while(j <= n && index != sum){
//targe[index++] = B[j++];
j++;
index++;
if(index == sum) {
flag1 = true;
break;
}
}
//printf("%d %d %d", i, j, index);
//printf("%ld\n", targe[sum]);
if(flag1 == true){
printf("%d\n", B[j]);
}else{
printf("%d\n", A[i]);
}
return 0;
}