PAT 1029

题意：给两串数字，合并求出中位数

思路：直接存为一个数组然后进行快排，最后取中间值

#include<iostream>#include<string>#include<algorithm>#include<string.h>using namespace std;long long a[2000005];int main(){int n;int i, j;scanf("%d", &n);for (i = 0; i < n; i++) {scanf("%lld", &a[i]);}scanf("%d", &n);for (j = i; j < i + n; j++) {scanf("%lld", &a[j]);}sort(a, a + j);printf("%lld", a[(j-1)/2]);    return 0;}