PAT A1029 Median (25 分)

题目注意点

• 题目数据实际不会超过int的范围
• 用了algorithm头文件会导致超时（迷惑
• 用INF防止访问越界

实现

利用双针法实现

#include <stdio.h>
const int maxn = 1000010;
const int INF = 0x7FFFFFFF;
int n1, n2;
int a1[maxn], a2[maxn];
int main() {
    scanf("%d", &n1);
    for (int i = 0; i < n1; i++) {
        scanf("%d", &a1[i]);
    }
    scanf("%d", &n2);
    for (int i = 0; i < n2 + n1; i++) {
        scanf("%d", &a2[i]);
    }
    a1[n1] = a2[n2] = INF;
    int mid = (n1 + n2 -1) / 2;
    int i = 0, j = 0, index = 0;
    while (index < mid) {
        if (a1[i] < a2[j]) i++;
        else j++;
        index++;
    }
    if (a1[i] < a2[j]) {
        printf("%d\n", a1[i]);
    } else {
        printf("%d\n", a2[j]);
    }
    return 0;
}