UVA Problem ID 10107 (What is the Median?)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.LinkedHashSet;
import java.util.TreeSet;

public class Main
{
	public static void main(String[] args) throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String input;
		StringBuilder sb = new StringBuilder("");
		TreeSet ts=new TreeSet();
		int ar[]=new int[10000];
		int k=0;
		while((input=br.readLine())!=null)
		{
			input=input.trim();
			int n=Integer.parseInt(input);
			ar[k++]=n;
			Arrays.sort(ar,0,k);
				
			if((k)%2!=0)
			{
				sb.append(ar[k/2]);
			}
			else
			{
				sb.append((ar[k/2-1]+ar[k/2])/2);

			}
			sb.append("\n");
		}
		System.out.print(sb);
	}
}