九度oj1004Median

#include<iostream>
using namespace std;
#include<algorithm>
#define maxn 2000010
int a[maxn];
 
int main()
{
    long int N1,N2;
 
    while(cin >> N1)
    {
        for(int i = 0; i < N1; i++)
            cin >> a[i];
        cin >> N2;
        for(int j = N1; j < N2+N1; j++)
            cin >> a[j];  
        sort(a,a+N1+N2);
        cout << a[(N1+N2-1)/2] << "\n";
    }
 
    return 0;
}
/**************************************************************
    Problem: 1004
    User: true14fans
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:9332 kb
****************************************************************/

才看完deitel的书前五章，这是个简便的方法。学了string类写个V5的回来