九度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

二.题目分析

   其实，第一反应以为是归并，后来发现直接qsort也很好呀.

三.代码

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[2000005];
int main()
{
        int n,m,i;
        while(scanf("%d",&n)!=EOF)
        {for(i=0;i<n;i++) scanf("%d",&a[i]);
        scanf("%d",&m);
        for(i=n;i<n+m;i++) scanf("%d",&a[i]);
        sort(a,a+n+m);
        printf("%d\n",a[(m+n-1)/2]);}
        return 0;
}