結果

問題 No.649 ここでちょっとQK!
ユーザー uafr_csuafr_cs
提出日時 2018-02-09 22:43:05
言語 Java
(openjdk 23)
結果
AC  
実行時間 913 ms / 3,000 ms
コード長 2,706 bytes
コンパイル時間 2,735 ms
コンパイル使用メモリ 80,976 KB
実行使用メモリ 68,380 KB
最終ジャッジ日時 2024-10-08 16:37:26
合計ジャッジ時間 16,517 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.ListIterator;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) throws IOException {
try (Scanner sc = new Scanner(System.in)) {
final long Q = sc.nextLong();
final long K = sc.nextLong();
PriorityQueue<Long> main_queue = new PriorityQueue<Long>(Collections.reverseOrder());
PriorityQueue<Long> other_queue = new PriorityQueue<Long>();
for(int i = 0; i < Q; i++){
final int q = sc.nextInt();
if(q == 1){
final long v = sc.nextLong();
//System.out.println(v + " " + main_queue + " " + other_queue);
main_queue.add(v);
while(main_queue.size() > K){
other_queue.add(main_queue.poll());
}
}else{
if(main_queue.size() < K){
System.out.println(-1);
}else{
final long v = main_queue.poll();
System.out.println(v);
if(!other_queue.isEmpty()){ main_queue.add(other_queue.poll()); }
}
}
}
}
}
public static class Scanner implements Closeable {
private BufferedReader br;
private StringTokenizer tok;
public Scanner(InputStream is) throws IOException {
br = new BufferedReader(new InputStreamReader(is));
}
private void getLine() throws IOException {
while (!hasNext()) {
tok = new StringTokenizer(br.readLine());
}
}
private boolean hasNext() {
return tok != null && tok.hasMoreTokens();
}
public String next() throws IOException {
getLine();
return tok.nextToken();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
public long nextLong() throws IOException {
return Long.parseLong(next());
}
public double nextDouble() throws IOException {
return Double.parseDouble(next());
}
public int[] nextIntArray(int n) throws IOException {
final int[] ret = new int[n];
for (int i = 0; i < n; i++) {
ret[i] = this.nextInt();
}
return ret;
}
public long[] nextLongArray(int n) throws IOException {
final long[] ret = new long[n];
for (int i = 0; i < n; i++) {
ret[i] = this.nextLong();
}
return ret;
}
public void close() throws IOException {
br.close();
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0