#include<cstdio>
const int maxn = 1000010;
const int INF = 0x7fffffff;
int s1[maxn], s2[maxn];
int main() {
int n, m;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &s1[i]);
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
scanf("%d", &s2[i]);
}
s1[n] = s2[m] = INF;
int medianPos = (n + m - 1) / 2;
int i = 0, j = 0, count = 0;
while (count < medianPos) {
if (s1[i] < s2[j])i++;
else j++;
count++;
}
if (s1[i] < s2[j])printf("%d\n", s1[i]);//输出当前位置较小的元素
else printf("%d\n", s2[j]);
return 0;
}
[PAT-A 1029]Media
最新推荐文章于 2022-03-22 10:30:30 发布