結果
問題 | No.275 中央値を求めよ |
ユーザー | Tsukasa_Type |
提出日時 | 2018-03-06 21:26:20 |
言語 | Java21 (openjdk 21) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,233 bytes |
コンパイル時間 | 2,286 ms |
コンパイル使用メモリ | 78,688 KB |
実行使用メモリ | 50,556 KB |
最終ジャッジ日時 | 2024-09-21 20:07:30 |
合計ジャッジ時間 | 5,233 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | RE | - |
testcase_02 | RE | - |
testcase_03 | AC | 47 ms
36,724 KB |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | AC | 47 ms
36,784 KB |
testcase_09 | AC | 47 ms
36,756 KB |
testcase_10 | RE | - |
testcase_11 | AC | 47 ms
36,672 KB |
testcase_12 | RE | - |
testcase_13 | AC | 47 ms
36,576 KB |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | AC | 50 ms
36,692 KB |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | AC | 50 ms
36,456 KB |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | AC | 51 ms
36,852 KB |
testcase_27 | AC | 50 ms
36,460 KB |
testcase_28 | AC | 49 ms
36,456 KB |
testcase_29 | AC | 49 ms
36,412 KB |
testcase_30 | AC | 48 ms
36,656 KB |
testcase_31 | RE | - |
testcase_32 | AC | 49 ms
36,740 KB |
testcase_33 | AC | 49 ms
36,780 KB |
testcase_34 | AC | 48 ms
36,752 KB |
testcase_35 | AC | 48 ms
36,448 KB |
testcase_36 | AC | 49 ms
36,460 KB |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | AC | 48 ms
36,680 KB |
testcase_40 | AC | 49 ms
36,436 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 (ar.length%2==0) { out.println((ar[n/2]+ar[n+1/2])/2); } 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) { } } }