AcWing 1506. 中位数
原题链接
简单
作者:
papapiu
,
2021-08-20 11:45:29
,
所有人可见
,
阅读 154
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 400010,M=200010;
int c[N],a[M],b[M];
int n,m;
int main()
{
cin>>n;
for (int i = 0; i < n; i ++ )
cin>>a[i];
cin>>m;
for (int i = 0; i < m; i ++ )
cin>>b[i];
int k = 0, i = 0, j = 0;
while (i < n && j < m)
if (a[i] <= b[j]) c[k ++ ] = a[i ++ ];
else c[k ++ ] = b[j ++ ];
while (i < n) c[k ++ ] = a[i ++ ];
while (j < m) c[k ++ ] = b[j ++ ];
printf("%d\n", c[(n + m - 1) / 2]);
return 0;
}