結果

問題 No.507 ゲーム大会(チーム決め)
ユーザー GrenacheGrenache
提出日時 2017-04-22 18:57:41
言語 Java21
(openjdk 21)
結果
AC  
実行時間 393 ms / 3,000 ms
コード長 4,851 bytes
コンパイル時間 5,841 ms
コンパイル使用メモリ 76,564 KB
実行使用メモリ 61,680 KB
最終ジャッジ日時 2023-09-28 21:24:00
合計ジャッジ時間 10,104 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
49,440 KB
testcase_01 AC 48 ms
49,792 KB
testcase_02 AC 48 ms
49,400 KB
testcase_03 AC 48 ms
49,316 KB
testcase_04 AC 48 ms
49,576 KB
testcase_05 AC 48 ms
49,624 KB
testcase_06 AC 48 ms
49,156 KB
testcase_07 AC 379 ms
60,120 KB
testcase_08 AC 378 ms
59,980 KB
testcase_09 AC 284 ms
60,356 KB
testcase_10 AC 266 ms
59,856 KB
testcase_11 AC 285 ms
60,216 KB
testcase_12 AC 291 ms
60,136 KB
testcase_13 AC 393 ms
59,780 KB
testcase_14 AC 368 ms
59,516 KB
testcase_15 AC 363 ms
59,836 KB
testcase_16 AC 363 ms
61,680 KB
testcase_17 AC 50 ms
49,400 KB
testcase_18 AC 49 ms
49,648 KB
testcase_19 AC 49 ms
49,504 KB
testcase_20 AC 49 ms
49,304 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder507 {

	private static Scanner sc;
	private static Printer pr;

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

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

		int l = -1;
		int r = n - 1;
		while (r - l > 1) {
			int mid = l + (r - l) / 2;
			if (isOK(a, ks, mid, m)) {
				r = mid;
			} else {
				l = mid;
			}
		}

		if (r == n - 1) {
			pr.println(-1);
		} else {
			pr.println(a[r]);
		}
	}

	private static boolean isOK(int[] a, int ks, int mid, int m) {
		int n = a.length;

		int t = ks + a[mid];

		Deque<Integer> st = new ArrayDeque<>(n - 1);
		for (int i = 0; i < n; i++) {
			if (i == mid) {
				continue;
			}

			st.addLast(a[i]);
		}

		int cnt = 0;
		while (!st.isEmpty()) {
			int tmp = st.removeLast();
			while (!st.isEmpty() && tmp + st.peekFirst() <= t) {
				st.removeFirst();
			}

			if (st.isEmpty()) {
				break;
			} else {
				st.removeFirst();
				cnt++;
			}
		}

		if (cnt < m) {
			return true;
		} else {
			return false;
		}
	}

	// ---------------------------------------------------
	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