Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequences is defined to be the median of the nondecreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.
Given two increasing sequences of integers, you are asked to find their median.
Input Specification:
Each input file contains one test case. Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤2×105) is the size of that sequence. Then N integers follow, separated by a space. It is guaranteed that all the integers are in the range of long int.
Output Specification:
For each test case you should output the median of the two given sequences in a line.
Sample Input:
4 11 12 13 14 5 9 10 15 16 17
Sample Output:
13
题意:两个序列,每个序列递增排列,找出这两个序列合并后的中位数。
思路:sort肯定是要超时的,只能实时寻找。
数的位置从1到n+m,中位数是位置为(n+m+1)/2上的数。
第一个序列正常读入。
- 初始化i=1,cnt=0。第二个序列每读入一个数都要和a[i]确定前后位置,cnt++并判断。
- 自己cnt++,再和mid比较
- 剩余的a[i] cnt++,再和mid比较
记模板~
#include<bits/stdc++.h>
using namespace std;
long int a[400005];
int main(){
int n,m,x,i,j,cnt=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
a[n+1]=0x3f3f3f;
scanf("%d",&m);
int mid=(n+m+1)/2;
i=1;
for(j=1;j<=m;j++){
scanf("%d",&x);
while(a[i]<x){
cnt++;
if(cnt==mid)
cout<<a[i];
i++;
}
cnt++;
if(cnt==mid) cout<<x;
}
while(i<=n){
cnt++;
if(cnt==mid) cout<<a[i];
i++;
}
return 0;
}