PAT A1029 Median (25分)

#include <cstdio>

int main(){
	int n1, n2;
	scanf("%d", &n1);
	long arr1[n1];
	
	for(int i=0; i<n1; i++){
		scanf("%ld", &arr1[i]);
	}
	
	scanf("%d", &n2);
	long arr2[n2];
	for(int i=0; i<n2; i++){
		scanf("%ld", &arr2[i]);
	}
	
	long long n = n1 + n2;
	long temp[n];
	
	int i=0, j=0, index=0;
	while(i<n1 && j<n2){
		if(arr1[i] <= arr2[j]){
			temp[index] = arr1[i];
			index++;
			i++;
		}else{
			temp[index] = arr2[j];
			index++;
			j++;
		}
	}
	while(i<n1){
		temp[index] = arr1[i];
		index++;
		i++;
	}
	while(j<n2){
		temp[index] = arr2[j];
		index++;
		j++;
	}
	
	if(n%2 != 0){
		printf("%ld", temp[n/2]);
	}else{
		printf("%ld", temp[n/2-1]);
	}
	
	return 0;
}

简单的序列合并问题