PAT甲 1029. Median (25)

1029. Median (25)

时间限制1000 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17} is 15. The median of two sequences is defined to be the medianof the nondecreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.Given two increasing sequences of integers, you are asked to find their median.InputEach input file contains one test case. Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (<=1000000) is the size of that sequence. Then N integers follow, separated by a space. It is guaranteedthat all the integers are in the range of long int.OutputFor each test case you should output the median of the two given sequences in a line.Sample Input

4 11 12 13 14
5 9 10 15 16 17

Sample Output

13

整体排序即可

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