結果
問題 | No.549 素材合成システム |
ユーザー | uwi |
提出日時 | 2017-07-28 22:24:37 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 169 ms / 2,000 ms |
コード長 | 3,161 bytes |
コンパイル時間 | 3,560 ms |
コンパイル使用メモリ | 81,248 KB |
実行使用メモリ | 41,456 KB |
最終ジャッジ日時 | 2024-04-18 11:51:17 |
合計ジャッジ時間 | 9,573 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,888 KB |
testcase_01 | AC | 52 ms
37,244 KB |
testcase_02 | AC | 51 ms
37,184 KB |
testcase_03 | AC | 51 ms
37,268 KB |
testcase_04 | AC | 51 ms
36,952 KB |
testcase_05 | AC | 52 ms
37,360 KB |
testcase_06 | AC | 52 ms
37,308 KB |
testcase_07 | AC | 168 ms
40,748 KB |
testcase_08 | AC | 167 ms
40,976 KB |
testcase_09 | AC | 169 ms
41,044 KB |
testcase_10 | AC | 167 ms
41,144 KB |
testcase_11 | AC | 135 ms
40,792 KB |
testcase_12 | AC | 165 ms
40,592 KB |
testcase_13 | AC | 134 ms
40,908 KB |
testcase_14 | AC | 139 ms
40,768 KB |
testcase_15 | AC | 168 ms
41,052 KB |
testcase_16 | AC | 134 ms
41,456 KB |
testcase_17 | AC | 78 ms
39,124 KB |
testcase_18 | AC | 85 ms
38,984 KB |
testcase_19 | AC | 86 ms
38,896 KB |
testcase_20 | AC | 76 ms
39,016 KB |
testcase_21 | AC | 98 ms
38,824 KB |
testcase_22 | AC | 96 ms
39,012 KB |
testcase_23 | AC | 100 ms
38,888 KB |
testcase_24 | AC | 128 ms
40,952 KB |
testcase_25 | AC | 123 ms
39,852 KB |
testcase_26 | AC | 165 ms
41,248 KB |
testcase_27 | AC | 156 ms
40,868 KB |
testcase_28 | AC | 52 ms
37,308 KB |
testcase_29 | AC | 52 ms
36,628 KB |
testcase_30 | AC | 52 ms
36,804 KB |
testcase_31 | AC | 76 ms
38,796 KB |
testcase_32 | AC | 81 ms
39,100 KB |
testcase_33 | AC | 88 ms
39,144 KB |
testcase_34 | AC | 75 ms
38,796 KB |
testcase_35 | AC | 90 ms
39,104 KB |
testcase_36 | AC | 91 ms
39,284 KB |
testcase_37 | AC | 94 ms
39,296 KB |
testcase_38 | AC | 53 ms
37,144 KB |
testcase_39 | AC | 53 ms
36,992 KB |
testcase_40 | AC | 114 ms
39,596 KB |
testcase_41 | AC | 98 ms
39,252 KB |
testcase_42 | AC | 55 ms
37,360 KB |
testcase_43 | AC | 64 ms
37,564 KB |
testcase_44 | AC | 56 ms
36,960 KB |
testcase_45 | AC | 66 ms
37,608 KB |
testcase_46 | AC | 57 ms
37,080 KB |
ソースコード
package contest170728; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); Arrays.sort(a); long ret = a[n-1]; for(int i = 0;i < n-1;i++){ ret += a[i]/2; } out.println(ret); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }