結果
問題 | No.275 中央値を求めよ |
ユーザー |
![]() |
提出日時 | 2017-06-20 15:40:17 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 64 ms / 1,000 ms |
コード長 | 2,055 bytes |
コンパイル時間 | 2,287 ms |
コンパイル使用メモリ | 79,464 KB |
実行使用メモリ | 38,032 KB |
最終ジャッジ日時 | 2024-06-25 00:33:28 |
合計ジャッジ時間 | 5,732 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;import java.io.OutputStream;import java.util.StringTokenizer;import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.HashMap;import java.util.Map;/*** Built using CHelper plug-in* Actual solution is at the top*/public class Main {public static void main(String[] args) {InputStream inputStream = System.in;OutputStream outputStream = System.out;InputReader in = new InputReader(inputStream);PrintWriter out = new PrintWriter(outputStream);Task solver = new Task();solver.solve(1, in, out);out.close();}static class Task {public void solve(int testNumber, InputReader in, PrintWriter out) {int N = in.nextInt();double a[] = new double[N];for(int i=0; i<N; i++){a[i] = (double)in.nextInt();}Arrays.sort(a);if(N%2==1) out.println(a[(N-1)/2]);else out.println((a[(N-2)/2]+a[(N)/2])/2);}}static class InputReader {public BufferedReader reader;public StringTokenizer tokenizer;public InputReader(InputStream stream) {reader = new BufferedReader(new InputStreamReader(stream), 32768);tokenizer = null;}public String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new StringTokenizer(reader.readLine());} catch (IOException e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}public int nextInt() {return Integer.parseInt(next());}public long nextLong() {return Long.parseLong(next());}}}