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×10^5 ) 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:
题目大意:
给定两个递增数列,寻找两个序列的中位数。
思路:
把两个序列放在一个数组中,然后排序,寻找最中间的数字输出。
排序这里,我用了c++中的sort()函数(可看下面了解sort:sort函数与getline函数——刷题过程中的C++学习之路(1)),非常方便。如果想用C语言可以自己写一个排序函数或者用qsort()。
13
代码:
#include<stdio.h>
#include<algorithm>
using namespace std;
long int nums[400010];
int main(){
int i, j, t = 0, ans;
for(i = 0; i < 2; i++){
int n;
scanf("%d", &n);
for(j = 0; j < n; j++){
scanf("%ld", &nums[t++]);
}
}
sort(nums, nums+t);
if(t % 2 == 0)
ans = nums[t/2-1];
else
ans = nums[(t+1)/2-1];
printf("%d", ans);
return 0;
}