hdu 4006 The kth great number(使用优先队列)

最新推荐文章于 2018-08-13 20:14:29 发布

bearfly1990

最新推荐文章于 2018-08-13 20:14:29 发布

阅读量420

点赞数

分类专栏： ACM 文章标签： integer string class

本文链接：https://blog.csdn.net/bearfight/article/details/6754709

版权

ACM 专栏收录该内容

73 篇文章 1 订阅

订阅专栏

http://acm.hdu.edu.cn/showproblem.php?pid=4006

/*
2011-9-6
author:BearFly1990
*/
package acm.hdu.tests;

import java.io.BufferedInputStream;
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.PriorityQueue;

import java.util.Scanner;

public class HDU_4006 {
    @SuppressWarnings("unchecked")
    public static void main(String[] args) {
        Scanner in = new Scanner(new BufferedInputStream(System.in));
        PriorityQueue<Integer> priorityQueue = 
            new PriorityQueue<Integer>(1000, new Comparator<Integer>(){

                public int compare(Integer obj1, Integer obj2) {
                    return obj1 - obj2;
                }
                
            });
        
        while(in.hasNext()){
            priorityQueue.clear();
            int n = in.nextInt();
            int k = in.nextInt();
            for(int i = 0 ; i < n; i++){
               String order = in.next();
               if(order.equals("I")){
                   int num = in.nextInt();
                   priorityQueue.add(num);
                   if(priorityQueue.size() > k){
                       priorityQueue.poll();
                   }
               }else{
                   System.out.println(priorityQueue.peek());
               }
            }
        }
    }
}