22分代码(内存超限):
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 400010;
int a[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int m;
cin >> m;
for (int i = n; i < n + m; i++) {
cin >> a[i];
}
sort(a, a + m + n);
cout << a[(m + n-1) / 2];
return 0;
}
上述改正后的AC代码(第二个数组的遍历起点不同,测试点8运行不超时):
#include <bits/stdc++.h>
using namespace std;
int a[400005];
int main(){
int n,m;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
for(int i=0;i<m;i++)
scanf("%d",&a[n+i]);
sort(a,a+m+n);
int mid=(m+n-1)/2;
cout<<a[mid]<<endl;
return 0;
}