OJ_1004 Median 求中位数

#include <iostream>#include <algorithm>using namespace std;long a[2000001]={0};void func(){    int n;  while(cin>>n)  {                              for(int i=0;i<n;i++)               {                       cin>>a[i];               }               int m;               cin>>m;               for(int j=0;j<m;j++)               {                       cin>>a[n+j];               }               sort(a,a+n+m);               int mid=(n+m+1)/2-1;                                             cout<<a[mid]<<endl;  }        }int main(int argc, char *argv[]){    //printf("Hello, world\n");func();return 0;}

简单解法：两个序列合并后排序再求中位数
更好解法：暂时未写

题目描述：

    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.

// 给N个数字的递增序列，中位数是中间的那个；而两个序列的中位数定义为包含两个序列集合的非递增序列的中位数

// 也就是说需要合并两个序列且保持递增，再求中位数

输入：

    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 145 9 10 15 16 17

样例输出：

13