結果

問題 No.649 ここでちょっとQK！
ユーザー OlandOland
提出日時 2019-08-24 14:19:13
言語 Java21
(openjdk 21)
結果
AC  
実行時間 561 ms / 3,000 ms
コード長 6,511 bytes
コンパイル時間 3,327 ms
コンパイル使用メモリ 80,612 KB
実行使用メモリ 64,676 KB
最終ジャッジ日時 2024-10-14 12:45:33
合計ジャッジ時間 13,625 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,484 KB
testcase_01 AC 56 ms
50,516 KB
testcase_02 AC 59 ms
50,332 KB
testcase_03 AC 239 ms
53,780 KB
testcase_04 AC 404 ms
59,132 KB
testcase_05 AC 428 ms
62,768 KB
testcase_06 AC 328 ms
61,116 KB
testcase_07 AC 57 ms
50,524 KB
testcase_08 AC 55 ms
50,440 KB
testcase_09 AC 58 ms
50,584 KB
testcase_10 AC 57 ms
50,308 KB
testcase_11 AC 57 ms
50,332 KB
testcase_12 AC 333 ms
56,384 KB
testcase_13 AC 329 ms
56,844 KB
testcase_14 AC 323 ms
56,620 KB
testcase_15 AC 381 ms
56,660 KB
testcase_16 AC 313 ms
56,364 KB
testcase_17 AC 376 ms
58,776 KB
testcase_18 AC 402 ms
59,304 KB
testcase_19 AC 410 ms
59,204 KB
testcase_20 AC 439 ms
59,320 KB
testcase_21 AC 466 ms
58,996 KB
testcase_22 AC 468 ms
59,328 KB
testcase_23 AC 497 ms
60,296 KB
testcase_24 AC 514 ms
61,484 KB
testcase_25 AC 540 ms
64,316 KB
testcase_26 AC 561 ms
64,676 KB
testcase_27 AC 68 ms
50,784 KB
testcase_28 AC 68 ms
50,432 KB
testcase_29 AC 71 ms
51,216 KB
testcase_30 AC 249 ms
58,572 KB
testcase_31 AC 264 ms
58,708 KB
testcase_32 AC 59 ms
50,308 KB
testcase_33 AC 57 ms
50,320 KB
testcase_34 AC 59 ms
50,308 KB
testcase_35 AC 57 ms
50,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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