題目鏈接：http://ac.jobdu.com/problem.php?pid=1004

詳解鏈接：https://github.com/zpfbuaa/JobduInCPlusPlus

參考代碼：

//
//  1004 Median.cpp
//  Jobdu
//
//  Created by PengFei_Zheng on 26/04/2017.
//  Copyright © 2017 PengFei_Zheng. All rights reserved.
//
 
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include 
 
<string.h>
#include <cmath>
#define MAX_SIZE 2000002
using namespace std;
 
int a[MAX_SIZE];
 
int n, m;
 
int cmp(void const *a,  void const *b){
    return *(int *)a - *(int *)b;
}
 
int main(){
    while(scanf("%d",&n)!=EOF){
        for(int i = 0 ; i < n ; i++){
            scanf(
 
"%d",&a[i]);
        }
        scanf("%d",&m);
        for(int i = n ; i < n+m ; i++){
            scanf("%d",&a[i]);
        }
        qsort(a,n+m,sizeof(a[0]),cmp);
        printf("%d\n",a[(n+m-1)/2]);
    }
    return 0;
}
/**************************************************************
    Problem: 1004
    User: zpfbuaa
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:9332 kb
***************************************************************
 
*/

題目1004：Median（qsort函數自定義cmp函數）