本文主要是介绍九度oj-1004-Median，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
- 题目描述：
-
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
- 样例输出：
-
13
- 来源：
- 2011年浙江大学计算机及软件工程研究生机试真题
-
-
#include<iostream> #include<algorithm> using namespace std; int a[2000010]; int main() {int n,i,k;while(cin>>n){k=0;for(i=0;i<n;i++)cin>>a[k++];cin>>n;for(i=0;i<n;i++)cin>>a[k++];sort(a,a+k);cout<<a[(k-1)/2]<<endl;}return 0; }
这篇关于九度oj-1004-Median的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
