pat2-13

#include<algorithm>
#include<vector>
using namespace std;
int main(){
  int n;scanf("%d",&n);
  int nth=(2*n-1)/2;
  vector<int>a(n),b(n);
  for(auto &x:a)scanf("%d",&x);
  for(auto &x:b)scanf("%d",&x);
  int i=0,j=0;
  for(int cnt=(2*n-1)/2;cnt;--cnt)
    a[i]<b[j]?++i:++j;
  printf("%d",a[i]<b[j]?a[i]:b[j]);
  return 0;
}

这是线性时间的，还有log(n)的,更优化一些

#include<algorithm>
#include<cstdio>
using namespace std;
const int N=100003;
int x[N],y[N];
int findkth(int *a,int m,int *b,int n,int k){
  if(m>n)return findkth(b,n,a,m,k);
  if(m==0)return b[k-1];
  if(k==1)return min(a[0],b[0]);
  int pa=std::min(m,k>>1),pb=k-pa;
  if(a[pa-1]==b[pb-1])return a[pa];
  else if(a[pa-1]<b[pb-1])
    return findkth(a+pa,m-pa,b,pb,k-pa);
  else return findkth(a,pa,b+pb,n-pb,k-pb);  
}
int main(){
  int n;scanf("%d",&n);
  for(int i=0;i<n;++i) scanf("%d",x+i);
  for(int i=0;i<n;++i) scanf("%d",y+i);
  printf("%d",findkth(x,n,y,n,n));
}