zoukankan      html  css  js  c++  java
  • HDU Problem 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): 10020    Accepted Submission(s): 3997

    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 4008 4005 4001 
     
    #include <cmath>
    #include <queue>
    #include <stack>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #define MAX_N 1005
    using namespace std;
    const int INF = 0xffff;
    
    struct node{
        int x;
        friend bool operator < (node a, node b) {
            return a.x > b.x;
        }
    }temp;
    int main() {
        int n, t, a;
        char s[7];
        while (scanf("%d%d", &n, &t) != EOF) {
            priority_queue<node> que;
            while (n--) {
                scanf("%s", s);
                if (s[0] == 'I') {
                    scanf("%d", &a);
                    temp.x = a;
                    que.push(temp);
                    while (que.size() > t) que.pop();
                }
                else {
                    printf("%d
    ", que.top().x);
                }
            }
        }
        return 0;
    }
  • 相关阅读:
    经典测试工程师面试题(一)
    python面试题2
    python面试题1
    软件测试面试题2
    软件测试面试题1
    python读写csv文件
    死亡还是合并?和李开复聊聊走投无路创业公司(转)
    项目如何开始:怎样和客户谈需求(转)
    [转载]给IT人员支招:如何跟业务部门谈需求分析?
    VS2013的一些常用快捷键
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770896.html
Copyright © 2011-2022 走看看