zoukankan      html  css  js  c++  java
  • 杭电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): 8312    Accepted Submission(s): 3283


    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   |   We have carefully selected several similar problems for you:  4003 4007 4004 4008 4005 
    //这个题, 想说几句, 题意真坑。
     1 #include <queue>
     2 #include <cstdio>
     3 #include <iostream>
     4 using namespace std;
     5 int main()
     6 {
     7     int n, t;
     8     while(~scanf("%d %d", &n, &t))
     9     {
    10         priority_queue <int, vector<int>, greater<int> >q;
    11         char ch[2]; int num;
    12         while(n--)
    13         {
    14             scanf("%s", &ch);
    15             if(ch[0] == 'I')
    16             {
    17                 scanf("%d", &num);
    18                 if(q.size() < t)       //队列未满; 
    19                 q.push(num);
    20                 else if(num > q.top()) //队头元素较小; 
    21                 {
    22                     q.pop();
    23                     q.push(num);
    24                 }
    25             }
    26             else
    27             printf("%d
    ", q.top());
    28         }
    29     }
    30     return 0;
    31 }
    32  
  • 相关阅读:
    基于redis实现的延迟消息队列
    Redis实现求交集操作结果缓存的设计方案
    限流算法之漏桶算法、令牌桶算法
    Apache设置防DDOS模块mod_evasive
    FastCGI技术
    详解强大的SQL注入工具——SQLMAP
    nginx根据域名做http,https分发
    Nginx配置SSL证书部署HTTPS网站
    JProfiler学习笔记
    Mysql压测工具mysqlslap 讲解
  • 原文地址:https://www.cnblogs.com/soTired/p/4684348.html
Copyright © 2011-2022 走看看