結果
問題 | No.649 ここでちょっとQK! |
ユーザー | Oland |
提出日時 | 2019-08-24 14:19:13 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 536 ms / 3,000 ms |
コード長 | 6,511 bytes |
コンパイル時間 | 2,461 ms |
コンパイル使用メモリ | 80,360 KB |
実行使用メモリ | 53,076 KB |
最終ジャッジ日時 | 2024-04-22 13:17:25 |
合計ジャッジ時間 | 13,265 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
37,288 KB |
testcase_01 | AC | 51 ms
36,996 KB |
testcase_02 | AC | 52 ms
37,280 KB |
testcase_03 | AC | 235 ms
41,500 KB |
testcase_04 | AC | 390 ms
47,948 KB |
testcase_05 | AC | 419 ms
50,844 KB |
testcase_06 | AC | 324 ms
50,392 KB |
testcase_07 | AC | 51 ms
37,164 KB |
testcase_08 | AC | 52 ms
37,180 KB |
testcase_09 | AC | 52 ms
37,108 KB |
testcase_10 | AC | 52 ms
37,108 KB |
testcase_11 | AC | 51 ms
37,128 KB |
testcase_12 | AC | 324 ms
45,916 KB |
testcase_13 | AC | 313 ms
46,372 KB |
testcase_14 | AC | 321 ms
46,456 KB |
testcase_15 | AC | 364 ms
46,264 KB |
testcase_16 | AC | 296 ms
44,468 KB |
testcase_17 | AC | 364 ms
47,696 KB |
testcase_18 | AC | 386 ms
47,336 KB |
testcase_19 | AC | 410 ms
47,008 KB |
testcase_20 | AC | 427 ms
47,896 KB |
testcase_21 | AC | 437 ms
47,020 KB |
testcase_22 | AC | 459 ms
47,712 KB |
testcase_23 | AC | 485 ms
48,380 KB |
testcase_24 | AC | 507 ms
49,628 KB |
testcase_25 | AC | 526 ms
52,524 KB |
testcase_26 | AC | 536 ms
53,076 KB |
testcase_27 | AC | 60 ms
37,364 KB |
testcase_28 | AC | 59 ms
37,316 KB |
testcase_29 | AC | 62 ms
37,136 KB |
testcase_30 | AC | 249 ms
46,212 KB |
testcase_31 | AC | 256 ms
46,516 KB |
testcase_32 | AC | 51 ms
37,264 KB |
testcase_33 | AC | 51 ms
37,128 KB |
testcase_34 | AC | 51 ms
37,212 KB |
testcase_35 | AC | 51 ms
37,148 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.Map.Entry; @SuppressWarnings("unused") public class Main { FastScanner in = new FastScanner(System.in); PrintWriter out = new PrintWriter(System.out); final int MOD = (int)1e9+7; void printlnYN(boolean b){out.println((b ? "Yes" : "No"));} void solve() throws Exception{ int Q = in.nextInt(), K = in.nextInt(); PriorityQueue<Long> left = new PriorityQueue<>(Comparator.reverseOrder()), right = new PriorityQueue<>(); for(int i = 0; i < Q; i++){ if(in.nextInt() == 1){ left.add(in.nextLong()); if(left.size() > K) right.add(left.remove()); }else{ if(left.size() < K){ out.println("-1"); }else{ out.println(left.remove()); if(!right.isEmpty()) left.add(right.remove()); } } } } public static void main(String[] args) throws Exception { new Main().m(); } void m() throws Exception { solve(); out.flush(); } static class FastScanner { Reader input; FastScanner() {this(System.in);} FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));} int nextInt() {return (int) nextLong();} long nextLong() { try { int sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } long ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) return ret * sign; ret *= 10; ret += b - '0'; } } catch (IOException e) { e.printStackTrace(); return -1; } } double nextDouble() { try { double sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } double ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) break; ret *= 10; ret += b - '0'; } if (b != '.') return sign * ret; double div = 1; b = input.read(); while ('0' <= b && b <= '9') { ret *= 10; ret += b - '0'; div *= 10; b = input.read(); } return sign * ret / div; } catch (IOException e) { e.printStackTrace(); return Double.NaN; } } char nextChar() { try { int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } return (char) b; } catch (IOException e) { e.printStackTrace(); return 0; } } String nextStr() { try { StringBuilder sb = new StringBuilder(); int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } while (b != -1 && !Character.isWhitespace(b)) { sb.append((char) b); b = input.read(); } return sb.toString(); } catch (IOException e) { e.printStackTrace(); return ""; } } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } public Long[] nextWrapperLongArray(int n) { Long[] res = new Long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public Long[] nextWrapperLongArrayDec(int n) { Long[] res = new Long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public Long[] nextWrapperLongArray1Index(int n) { Long[] res = new Long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } } } /* end Main */