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;
    }
    

      

  • 相关阅读:
    288 Node.js模块化开发:js开发弊端,模块的概念,模块成员导出的2种方式及其区别,模块成员导入
    287 Node.js快速入门:Node.js 的组成,Node.js基础语法,Node.js全局对象global
    286 Node开发概述,Node运行环境搭建以及安装失败解决办法
    285 H5 Web Workers
    使用nvm安装nodejs
    函数式 UI:Web开发终于摆脱了框架的束缚
    Vue渲染函数
    微信小程序使用canvas实现生成海报图的功能
    Vue中插槽指令
    Vue之nextTick原理
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3416828.html
Copyright © 2011-2022 走看看