只能想出这种菜算法,果然超时,不过把cin改成scanf就过了,,,还真是c 的输入输出快
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
using namespace std;
bool cmp1(long int a,long int b){
return a<b;
}
int main(){
int n,m;
scanf("%d",&n);
vector<long int> v(n);
for(int i=0;i<n;i++){
scanf("%ld",&v[i]);
}
scanf("%d",&m);
v.resize(n+m);
for(int i=0;i<m;i++){
scanf("%ld",&v[n+i]);
}
sort(v.begin(),v.end());
printf("%ld",v[(n+m-1)/2]);
return 0;
}