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.
Sample Input:
4 11 12 13 14
5 9 10 15 16 17
Sample Output:
13
输入两个递增序列,输出所有数的中位数
vector的使用、sort排序
思路如下:
- 声明一个vector seq,分别将两个序列加进去
- sort排序,sort(seq.begin(),seq.end())
- 最后判奇偶,取出即可
代码如下:
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> seq;
int main(){
int m,n,temp;
cin>>m;
for(int i=0;i<m;i++){
cin>>temp;
seq.push_back(temp);
}
cin>>n;
for(int i=0;i<n;i++){
cin>>temp;
seq.push_back(temp);
}
sort(seq.begin(),seq.end());
int sum = m+n;
if(sum%2==0){
cout<<seq[sum/2-1]<<endl;
}else{
cout<<seq[sum/2]<<endl;
}
return 0;
}