题目1004：Median

最新推荐文章于 2022-02-10 20:22:47 发布

原创最新推荐文章于 2022-02-10 20:22:47 发布 · 257 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法，该算法接收两个递增整数序列作为输入，并输出这两个序列合并后的中位数。通过先合并两个序列再排序的方法找到中位数。

题目描述：

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 non-decreasing 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.

输入：

    Each input file may contain more than one test case.
    Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤1000000) 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.

输出：

For each test case you should output the median of the two given sequences in a line.

样例输入：

4 11 12 13 14
5 9 10 15 16 17

样例输出：

#include<stdio.h>
#include<algorithm>
using namespace std;

int arr[2000000];
int main(){
int numberA = 0, numberB = 0;
while (scanf("%d", &numberA) != EOF){
int indexArr = 0;
for (int i = 0; i < numberA; i++){
scanf("%d", &arr[indexArr++]);
}
scanf("%d", &numberB);
for (int i = 0; i < numberB; i++){
scanf("%d", &arr[indexArr++]);
}
int length = numberA + numberB;
sort(arr, arr + length);
printf("%d\n", arr[(length-1) / 2]);
}
return 0;
}