1029. Median (25)

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	int n;
	scanf("%d", &n);

	int i;
	long int num;
	vector<long int> v;

	for(i = 1; i <= n; i++)
	{
		scanf("%ld", &num);
		v.push_back(num);
	}

	int m;
	scanf("%d", &m);

	for(i = 1; i <= m; i++)
	{
		scanf("%ld", &num);
		v.push_back(num);
	}

	sort(v.begin(), v.end());

	n += m;
	int half;

	if(n % 2 == 0)
	{
		half = n / 2 - 1;
	}
	else
	{
		half = (n + 1) / 2 - 1;
	}

	printf("%ld\n", v[half]);

	system("pause");
	return 0;
}