1029 Median

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

---

题目大意

求俩个非递减数列的合并后的中位数

---

思路

 读入第一个数组后，开始一边读入第二个数组，一边动态判断数的大小，当该数的大小排在(N+M+1)/2的时候，即为中位数

---

C/C++ 

#include <iostream>
using namespace std;
int nums[200005];
int main(){
    int N, M,key,op=1,num;
    cin >> N;
    for(int z=1;z<=N;z++) cin >> nums[z];
    cin >> M;
    key = (N+M+1)/2;
    for(int z=1;z<=M;z++) {
        cin >> num;
        while (op<=N && nums[op]<num) {
            if(--key==0) cout << nums[op];
            op++;
        }
        if (--key == 0) cout << num;
    }
    while(op<=N){
        if (--key==0) cout << nums[op];
        op++;
    }
    return 0;
}

---