题解 | Median

	#include<bits/stdc++.h>
	using namespace std;

	int main() {
		int n, m;
		vector<int> v;
		int temp = 0;
		scanf("%d", &n);
		for (int i = 0; i < n; i++) {
			scanf("%d", &temp);
			v.push_back(temp);
		}
		scanf("%d", &m);
		for (int i = 0; i < m; i++) {
			scanf("%d", &temp);
			v.push_back(temp);
		}
		sort(v.begin(), v.end());
		if(v.size()%2==0)
			printf("%d", v[v.size() / 2-1]);
		else
			printf("%d", v[v.size() / 2]);
		return 0;
	}