zoukankan      html  css  js  c++  java
  • HDU 4006 The kth great number (优先队列)

    The kth great number

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
    Total Submission(s): 5049    Accepted Submission(s): 2069


    Problem Description
    Xiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xiao Bao what the kth great number is. Because the number written by Xiao Ming is too much, Xiao Bao is feeling giddy. Now, try to help Xiao Bao.
     
    Input
    There are several test cases. For each test case, the first line of input contains two positive integer n, k. Then n lines follow. If Xiao Ming choose to write down a number, there will be an " I" followed by a number that Xiao Ming will write down. If Xiao Ming choose to ask Xiao Bao, there will be a "Q", then you need to output the kth great number. 
     
    Output
    The output consists of one integer representing the largest number of islands that all lie on one line. 
     
    Sample Input
    8 3 I 1 I 2 I 3 Q I 5 Q I 4 Q
     
    Sample Output
    1 2 3
    Hint
    Xiao Ming won't ask Xiao Bao the kth great number when the number of the written number is smaller than k. (1=<k<=n<=1000000).
     
    Source
     
    Recommend
    lcy
     
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<queue>
    #include<algorithm>
    #include<vector>
    
    using namespace std;
    
    int n,k;
    priority_queue<int,vector<int>,greater<int> >q;
    
    int main(){
    
        //freopen("input.txt","r",stdin);
    
        char op[3];
        int x;
        while(~scanf("%d%d",&n,&k)){
            while(!q.empty())
                q.pop();
            for(int i=0;i<k;i++){
                scanf("%s%d",op,&x);
                q.push(x);
            }
            for(int i=k;i<n;i++){
                scanf("%s",op);
                if(op[0]=='Q')
                    printf("%d
    ",q.top());
                else{
                    scanf("%d",&x);
                    if(x>q.top()){
                        q.pop();
                        q.push(x);
                    }
                }
            }
        }
        return 0;
    }
  • 相关阅读:
    General Problem Solving Techniques [Beginner-1]~H
    做HDU1010 带出来一个小问题
    HDU1009
    hdu1007
    hdu 1008
    HDU1006
    hdu 1005
    hdu 1004
    UVA 10970 第一次比赛 D题 (后面才补的)
    LightOJ 1317 第八次比赛 A 题
  • 原文地址:https://www.cnblogs.com/jackge/p/3221290.html
Copyright © 2011-2022 走看看