1029 Median （PAT甲级）

这道题我是暴力求解的，当时还很迷惑这个题的考点在哪里……后来看了下柳婼的解法，才发现两个sequence是递增的，所以可以用归并思想来做。

修改后的代码：

#include <cstdio>
#include <vector>

int main(){
    int m, n, i, j, cnt;
    long ans;
    scanf("%d", &m);
    std::vector<long> a(m);
    for(i = 0; i < m; ++i){
        scanf("%ld", &a[i]);
    }
    scanf("%d", &n);
    std::vector<long> b(n);
    for(i = 0; i < n; ++i){
        scanf("%ld", &b[i]);
    }
    i = 0;
    j = 0;
    cnt = 0;
    while(cnt < (m + n + 1) / 2){
        if(i < m && j < n){
            if(a[i] <= b[j]){
                ans = a[i++];
            } else{
                ans = b[j++];
            }
        } else if(i == m){
            ans = b[j++];
        } else{
            ans = a[i++];
        }
        cnt++;
    }
    printf("%ld", ans);
    return 0;
}

起先的代码:

#include <cstdio>
#include <vector>
#include <algorithm>

int main(){
    int N;
    long t;
    std::vector<long> vec;
    for(int i = 0; i < 2; ++i){
        scanf("%d", &N);
        for(int j = 0; j < N; ++j){
            scanf("%ld", &t);
            vec.push_back(t);
        }
    }
    sort(vec.begin(), vec.end());
    printf("%ld", vec[(vec.size() - 1) / 2]);
    return 0;
}

题目如下：

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