結果

問題 No.649 ここでちょっとQK！
コンテスト
ユーザー Grenache
提出日時 2018-02-09 23:06:21
言語 Java
(openjdk 23)
結果
AC  
実行時間 970 ms / 3,000 ms
コード長 5,099 bytes
コンパイル時間 4,043 ms
コンパイル使用メモリ 80,532 KB
実行使用メモリ 75,296 KB
最終ジャッジ日時 2024-10-08 18:08:03
合計ジャッジ時間 20,577 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder649 {

	private static Scanner sc;
	private static Printer pr;

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

		int[] qt = new int[q];
		long[] qv = new long[q];
		Set<Long> hs = new HashSet<>();
		for (int i = 0; i < q; i++) {
			qt[i] = sc.nextInt();
			if (qt[i] == 1) {
				qv[i] = sc.nextLong();
				hs.add(qv[i]);
			}
		}

		List<Long> list = new ArrayList<>(hs);
		Collections.sort(list);
		int n = list.size();

		BIT bit = new BIT(n);
		for (int i = 0; i < q; i++) {
			if (qt[i] == 1) {
				int index = Collections.binarySearch(list, qv[i]) + 1;
				bit.update(index, 1);
			} else {
				int l = 0;
				int r = n + 1;
				while (r - l > 1) {
					int mid = l + (r - l) / 2;
					if (bit.sum(mid) >= k) {
						r = mid;
					} else {
						l = mid;
					}
				}

				if (r == n + 1) {
					pr.println(-1);
				} else {
					pr.println(list.get(r - 1));
					bit.update(r, -1);
				}
			}
		}
	}

	private static class BIT {
		// [0,n-1]
		int[] bit;
		int n;
		// [1,n]
		BIT(int n) {
			this.n = n;
			bit = new int[this.n];
		}

		// i:1-indexed
		void update(int i, int x) {
			while (i <= n) {
				bit[i - 1] += x;
				i += i & (-i);
			}
		}

		// i:1-indexed
		int sum(int i) {
			int sum = 0;
			while (i > 0) {
				sum += bit[i - 1];
				i -= i & (-i);
			}

			return sum;
		}
	}

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