zoukankan      html  css  js  c++  java
  • HDU4006(小根堆)

    The kth great number

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


    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
    #include <cstdio>
    #include <string.h>
    #include <queue>
    #include <vector>
    using namespace std;
    const int MAXN=1000005;
    int n,k;
    int vis[MAXN];
    int main()
    {
        while(scanf("%d%d",&n,&k)!=EOF)
        {
            memset(vis,0,sizeof(vis));
            priority_queue<int,vector<int>,greater<int> > que;
            for(int i=0;i<n;i++)
            {
                scanf("%*c");
                char op;
                scanf("%c",&op);
                if(op=='I')
                {
                    int x;
                    scanf("%d",&x);
                    if(!vis[x])
                    {
                        que.push(x);
                    }
                    if(que.size()>k)
                    {
                        int y=que.top();
                        vis[y]=0;
                        que.pop();
                    }
                }
                else
                {
                    int res=que.top();
                    printf("%d
    ",res);
                }
            }
        }
        return 0;
    }
  • 相关阅读:
    [转]人生哲理小故事
    取PE文件OriginalFilename解析VERSION资源
    [转]COM对象创建外部机制
    读书的几个步骤
    zoj 2412 Farm Irrigation
    HDU 1575 Tr A
    toj 2843 Diamonds
    HDU 1856 More is better
    toj 2841 Bitwise Reverse
    hdu 1213 How Many Tables
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5688329.html
Copyright © 2011-2022 走看看