题目链接:1029 Median (25 分)
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输出中位数
// 解法二:归并思想找中位数,即在两个有序序列比较计数,直到median,若一个序列数完还没找到,可由公式得到,这个方法复杂度更好
// 让我很迷惑的一点是,这道题当数据为偶数个时,中位数不是两个求平均,而是靠左那一个数字
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 10;
long long a[maxn];
int main()
{
int n; cin >> n;
int t, cnt(0);
for(int i = 0; i < n; i++){
scanf("%lld", &a[cnt++]);
}
int m; cin >> m;
for(int i = 0; i < m; i++){
scanf("%lld", &a[cnt++]);
}
sort(a, a + cnt);
if(cnt % 2) cout << a[cnt / 2] << endl;
else cout << a[cnt / 2 - 1] << endl;
return 0;
}