pat1029 merge

最新推荐文章于 2021-02-07 14:32:49 发布

汪少升

最新推荐文章于 2021-02-07 14:32:49 发布

阅读量376

点赞数

文章标签： pat

本文链接：https://blog.csdn.net/u014801032/article/details/24625947

版权

i want to try list first,but the memory exceeds for three cases.

cin cannot be used for time limited.

#include<iostream>
#include<algorithm>
#include<climits>
using namespace std;

int main(){
	int n,m;
	const int N=1000002;
	int a[N],b[N];
	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",&b[i]);
	}
	b[m]=a[n]=INT_MAX;
	int *i=a,*j=b,count=0;
	int mid=(m+n-1)/2;
	while(count!=mid){
		if(*i>*j) ++j;
		else ++i;
		++count;
	}
	printf("%d",min(*i,*j));
	return 0;
}