#241891 (Java21) No.275 中央値を求めよ

• 問題: No.275 中央値を求めよ
• ユーザー: Tsukasa_Type
• 提出日時: 2018-03-06 21:29:26
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 48 ms / 1,000 ms
• コード長: 2,229 bytes
• コンパイル時間: 2,365 ms
• コンパイル使用メモリ: 74,964 KB
• 実行使用メモリ: 49,808 KB
• 最終ジャッジ日時: 2023-09-07 06:30:58
• 合計ジャッジ時間: 5,737 ms
• ジャッジサーバーID （参考情報）: judge11 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	45 ms; 49,360 KB
testcase_01	AC	44 ms; 49,248 KB
testcase_02	AC	45 ms; 49,296 KB
testcase_03	AC	44 ms; 49,216 KB
testcase_04	AC	44 ms; 49,356 KB
testcase_05	AC	44 ms; 49,544 KB
testcase_06	AC	44 ms; 49,512 KB
testcase_07	AC	45 ms; 49,352 KB
testcase_08	AC	44 ms; 49,460 KB
testcase_09	AC	45 ms; 49,172 KB
testcase_10	AC	44 ms; 49,480 KB
testcase_11	AC	44 ms; 49,516 KB
testcase_12	AC	43 ms; 49,552 KB
testcase_13	AC	44 ms; 47,352 KB
testcase_14	AC	44 ms; 49,264 KB
testcase_15	AC	46 ms; 49,440 KB
testcase_16	AC	46 ms; 49,364 KB
testcase_17	AC	46 ms; 49,224 KB
testcase_18	AC	46 ms; 49,388 KB
testcase_19	AC	46 ms; 49,264 KB
testcase_20	AC	46 ms; 49,808 KB
testcase_21	AC	46 ms; 49,372 KB
testcase_22	AC	47 ms; 49,440 KB
testcase_23	AC	45 ms; 49,156 KB
testcase_24	AC	46 ms; 47,524 KB
testcase_25	AC	46 ms; 49,248 KB
testcase_26	AC	47 ms; 49,248 KB
testcase_27	AC	47 ms; 49,236 KB
testcase_28	AC	46 ms; 49,368 KB
testcase_29	AC	45 ms; 49,408 KB
testcase_30	AC	45 ms; 49,360 KB
testcase_31	AC	46 ms; 47,496 KB
testcase_32	AC	45 ms; 49,188 KB
testcase_33	AC	47 ms; 49,192 KB
testcase_34	AC	44 ms; 49,196 KB
testcase_35	AC	46 ms; 49,352 KB
testcase_36	AC	46 ms; 49,460 KB
testcase_37	AC	47 ms; 49,572 KB
testcase_38	AC	46 ms; 49,512 KB
testcase_39	AC	45 ms; 49,336 KB
testcase_40	AC	48 ms; 49,508 KB

ソースコード

import java.util.*;
import static java.lang.System.*;
import java.io.*;

public class Main {
	static FastScanner sc = new FastScanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] ar = new int[n];
		for (int i=0; i<n; i++) {
			ar[i] = sc.nextInt();
		}
		Arrays.sort(ar);
		if (n%2==0) {
			out.println((ar[n/2]+ar[(n/2)-1])/2.0);
		}
		else {
			out.println(ar[n/2]);
		}
	}
}

class FastScanner implements Closeable {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	public FastScanner(InputStream in) {
		this.in = in;
	}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
		return (int) nl;
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public void close() {
		try {
			in.close();
		} catch (IOException e) {
		}
	}
}