zoukankan      html  css  js  c++  java
  • hdu 4006 优先队列

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

    The kth great number

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


    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).
     
     
     
    #include <string.h>
    #include <stdio.h>
    #include <queue>
    #include <iostream>
    using namespace std;
    struct great
    {
        int k;
    };
    struct cmp
    {
        bool operator()(great a,great b)
        {
            return a.k>b.k;
        }
    };
    
    priority_queue<great,vector<great>,cmp> q,p;
    
    int main()
    {
        int n,m,i,j,t;
        char str[3];
        great s;
        while(scanf("%d%d",&n,&m)!=EOF)
        {
            while(!q.empty())q.pop();
            int t=0;
            while(n--)
            {
    
                scanf("%s",str);
                if(str[0]=='I')
                {
                    scanf("%d",&s.k);
                    q.push(s);
                    if(q.size()>m)
                    {
    
                            q.pop();
                    }
    
                }
                else
                {
                    printf("%d
    ",q.top());
                    //q.pop();
                }
            }
        }
        return 0;
    }
    

      

    这样为什么就不可以呢?

    思考中……

    #include <string.h>
    #include <stdio.h>
    #include <queue>
    #include <iostream>
    using namespace std;
    struct great
    {
        int k;
    };
    struct cmp
    {
        bool operator()(great a,great b)
        {
            return a.k>b.k;
        }
    };
    
    priority_queue<great,vector<great>,cmp> q,p;
    
    int main()
    {
        int n,m,i,j,t;
        char str[3];
        great s;
        while(scanf("%d%d",&n,&m)!=EOF)
        {
            int t=1;
            while(n--)
            {
    
                scanf("%s",str);
                if(str[0]=='I')
                {
                    scanf("%d",&s.k);
                    q.push(s);
                    t++;
                    if(t>m)
                    {
                        for(i=t-m;i>=1;i--)
                            q.pop();
                    }
                }
                else
                {
                    printf("%d
    ",q.top());
                    //q.pop();
                }
            }
        }
        return 0;
    }
    

      

  • 相关阅读:
    白话经典算法系列之六 高速排序 高速搞定
    簡單SQL存儲過程實例
    ACE编译运行错误解决
    shell之变量与read
    Java实现第八届蓝桥杯魔方状态
    Java实现第八届蓝桥杯魔方状态
    Java实现第八届蓝桥杯魔方状态
    Java实现第八届蓝桥杯魔方状态
    Java实现第八届蓝桥杯购物单
    Java实现第八届蓝桥杯购物单
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3416828.html
Copyright © 2011-2022 走看看