結果

問題 No.549 素材合成システム
ユーザー GrenacheGrenache
提出日時 2017-07-28 22:40:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 186 ms / 2,000 ms
コード長 4,094 bytes
コンパイル時間 3,975 ms
コンパイル使用メモリ 79,232 KB
実行使用メモリ 55,192 KB
最終ジャッジ日時 2024-10-10 03:17:31
合計ジャッジ時間 11,199 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
50,556 KB
testcase_01 AC 57 ms
50,312 KB
testcase_02 AC 56 ms
50,596 KB
testcase_03 AC 57 ms
50,748 KB
testcase_04 AC 55 ms
50,556 KB
testcase_05 AC 56 ms
50,588 KB
testcase_06 AC 56 ms
50,720 KB
testcase_07 AC 177 ms
53,592 KB
testcase_08 AC 177 ms
53,564 KB
testcase_09 AC 179 ms
53,912 KB
testcase_10 AC 184 ms
53,540 KB
testcase_11 AC 181 ms
53,536 KB
testcase_12 AC 186 ms
53,560 KB
testcase_13 AC 182 ms
55,192 KB
testcase_14 AC 179 ms
53,416 KB
testcase_15 AC 184 ms
53,416 KB
testcase_16 AC 180 ms
53,132 KB
testcase_17 AC 116 ms
52,720 KB
testcase_18 AC 110 ms
52,852 KB
testcase_19 AC 107 ms
52,688 KB
testcase_20 AC 116 ms
53,024 KB
testcase_21 AC 141 ms
53,164 KB
testcase_22 AC 145 ms
53,212 KB
testcase_23 AC 149 ms
53,164 KB
testcase_24 AC 167 ms
53,364 KB
testcase_25 AC 162 ms
53,376 KB
testcase_26 AC 173 ms
53,548 KB
testcase_27 AC 151 ms
53,288 KB
testcase_28 AC 54 ms
50,508 KB
testcase_29 AC 57 ms
50,532 KB
testcase_30 AC 57 ms
50,224 KB
testcase_31 AC 121 ms
52,888 KB
testcase_32 AC 118 ms
53,080 KB
testcase_33 AC 109 ms
52,984 KB
testcase_34 AC 116 ms
53,040 KB
testcase_35 AC 150 ms
53,016 KB
testcase_36 AC 120 ms
53,872 KB
testcase_37 AC 114 ms
53,008 KB
testcase_38 AC 55 ms
50,440 KB
testcase_39 AC 56 ms
50,064 KB
testcase_40 AC 154 ms
53,284 KB
testcase_41 AC 115 ms
52,944 KB
testcase_42 AC 68 ms
50,672 KB
testcase_43 AC 91 ms
52,728 KB
testcase_44 AC 87 ms
51,012 KB
testcase_45 AC 104 ms
52,860 KB
testcase_46 AC 93 ms
51,976 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder549 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		int[] x = new int[n];
		for (int i = 0; i < n; i++) {
			x[i] = sc.nextInt();
		}
		Arrays.sort(x);

		int ret = x[n - 1];
		for (int i = 0; i < n - 1; i++) {
			ret += x[i] / 2;
		}

		pr.println(ret);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0