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
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 (<=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.
Output
For each test case you should output the median of the two given sequences in a line.
Sample Input4 11 12 13 14 5 9 10 15 16 17Sample Output
13 思路:给出两已排序数组,找出两个数组的中间值,利用两个数组的排序性,直接使用合并排序。由于数字量较大,要使用C的输入输出,不然会超时。#include<vector> #include<cstdio> #include<iostream> #include<algorithm> using namespace std; int main() { int m, n, t; while (scanf("%d", &n) != EOF) { vector<int> a(n); for (int i=0; i!=n; ++i) scanf("%d", &a[i]); cin >> m; vector<int> b(m); for (int i=0; i!=m; ++i) scanf("%d", &b[i]); vector<int> c(m+n); merge(a.begin(), a.end(),b.begin(), b.end(), c.begin()); //合并排序 printf("%d\n", c[(m+n-1) / 2] ); } return 0; }