#include<iostream>#include<cstring>#include<vector>#include<stdio.h>#include<queue>#include<math.h>#include<stack>#include<algorithm>#include<map>#include<set>#define MAX 99999999usingnamespace std;typedeflonglong ll;
ll a[4000001];intmain(){
ll n,m;scanf("%lld",&n);
ll i =0;for(i =0;i<n;i++){scanf("%lld",&a[i]);}scanf("%lld",&m);for(;i<m+n;i++){scanf("%lld",&a[i]);}sort(a,a+n+m);
ll med =(n+m)/2;if((n+m)%2==0)
med --;
cout<<a[med];return0;}
题目:1029 Median (25分) 分析:两个数组合并后求中位数,偶数个情况:1、2、3、4中位数为2第一次写的时候看通过率那么低没敢尝试,结果这次复习的时候用简单的方法过了看别人说要骚操作,然而~~~#include <iostream>#include<cstring>#include<vector>#include<stdio.h>#include<queue>#include<math.h>#incl.