题目地址:http://pat.zju.edu.cn/contests/pat-a-practise/1029
代码如下:
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> v1;
vector<int> v2;
vector<int> v;
int main()
{
freopen("C:\\Users\\Devon\\Desktop\\input.txt","r",stdin);
int num=0;
v1.clear();
v2.clear();
v.clear();
int len1;
scanf("%d",&len1);
num+=len1;
for(int i=0;i<len1;i++){
int t;
scanf("%d",&t);
v1.push_back(t);
}
v1.push_back(0x7fffffff);
int len2;
scanf("%d",&len2);
num+=len2;
for(int i=0;i<len2;i++){
int t;
scanf("%d",&t);
v2.push_back(t);
}
v2.push_back(0x7fffffff);
int cursor1,cursor2;
cursor1=cursor2=0;
while(cursor1<len1||cursor2<len2){
if(v1[cursor1]>=v2[cursor2]) v.push_back(v2[cursor2]),cursor2++;
else v.push_back(v1[cursor1]),cursor1++;
}
if(num%2==0) printf("%d\n",v[num/2-1]);
else printf("%d\n",v[num/2]);
return 0;
}