【九度】题目1004：Median

Given 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 median of the non-decreasing 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.

输入：

    Each input file may contain more than 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 guaranteed that all the integers are in the range of long int.

输出：

    For each test case you should output the median of the two given sequences in a line.

样例输入：

4 11 12 13 14
5 9 10 15 16 17

样例输出：

13

WA

import java.util.Scanner;

//import java.util.Arrays;
//import java.util.Scanner;

public class main {
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		while (cin.hasNext()) {
			long[] list1 = null;
			long[] list2 = null;
			int len1, len2;

			len1 = cin.nextInt();
			list1 = new long[len1];
			for (int i = 0; i < len1; i++) {
				list1[i] = cin.nextLong();
				// System.out.println(list1[i]);
			}

			len2 = cin.nextInt();
			// System.out.println(len2);
			list2 = new long[len2];
			for (int i = 0; i < len2; i++) {
				list2[i] = cin.nextLong();
				// System.out.println(list2[i]);

			}

			long[] list3 = new long[len1 + len2];
			int m = 0, n = 0;
			for (int i = 0; i < len1 + len2; i++) {
				if (m == len1) {
					for (; n < len2; n++)
						list3[i] = list2[n];
				} else if (n == len2) {
					for (; m < len1; m++)
						list3[i] = list1[m];
				} else {
					if (list1[m] >= list2[n]) {
						list3[i] = list2[n];
						n++;
					} else if (list1[m] < list2[n]) {
						list3[i] = list1[m];
						m++;
					}
				}
			}
			if (((len1 + len2) % 2) == 0)
				System.out.println(list3[(len1 + len2) / 2 - 1]);
			else
				System.out.println(list3[(len1 + len2) / 2]);
		}
	}
}

AC

import java.util.Arrays;
import java.util.Scanner;
/**
 * to test problem_1004
 * @author Sunkun
 * Date: 2013.09.27
 * Memory: 18836KB
 * Code Length: 1025B
 * Time Consuming: 120MS
 */
public class problem_1004 {
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		while(input.hasNext()){
			long[] array1 = null;
			long[] array2 = null;
			
			// 第一个数组
			int len = input.nextInt();
			array1 = new long[len];
			for(int i = 0; i < len; i++){
				array1[i] = input.nextLong();
			}
			
			// 第二个数组
			len = input.nextInt();
			array2 = new long[len];
			for(int i = 0; i < len; i++){
				array2[i] = input.nextLong();
			}
			
			// 两数组合并
			long[] total = new long[array1.length + array2.length];
			int j = 0;
			
			for(int i = 0; i < array1.length; i++){
				total[j++] = array1[i];
			}
			for(int i = 0; i < array2.length; i++){
				total[j++] = array2[i];
			}
			
			// 合并后的数组排序
			Arrays.sort(total);
			
			// 输出合并后数组的中间值
			if(total.length%2 == 0){
				System.out.println(total[total.length/2-1]);
			}else{
				System.out.println(total[total.length/2]);
			}
		}
	}
}