题目

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.

输入

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×) 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.

输出

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

样例输入 

4 11 12 13 14
5 9 10 15 16 17

样例输出 

13

题意理解

给你两个序列 

n个数 然后输入n个数

m个数 然后输入m个数

将两个序列合并然后排序，最后输出合并以后的中位数

代码 

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
typedef long long LL;
vector<LL>ve;

int main(){
    int n,m;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
       LL x;
       scanf("%lld",&x);
       ve.push_back(x);
    }
    scanf("%d",&m);
    for(int i=0;i<m;i++){
       LL x;
       scanf("%lld",&x);
       ve.push_back(x);
    }
    sort(ve.begin(),ve.end());
    printf("%lld\n",ve[(n+m+1)/2-1]);
    return 0;
}