zoukankan      html  css  js  c++  java
  • 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): 8881    Accepted Submission(s): 3518


    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
     1 #include <iostream>
     2 #include <stdio.h>
     3 #include <queue>
     4 using namespace std;
     5 int a[1000000+10];
     6 struct node
     7 {
     8     friend bool operator< (node a,node b)
     9     {
    10         return a.v>b.v; 
    11     }
    12     int v;
    13 };
    14 int main()
    15 {
    16     int n,k;
    17     int i,j;
    18     char ch;
    19     freopen("in.txt","r",stdin);
    20     while(scanf("%d%d",&n,&k)!=EOF)
    21     {
    22         bool flag=0;
    23         getchar();
    24         priority_queue<node> s;
    25         for(i=0;i<n;i++)
    26         {
    27             scanf("%c",&ch);
    28             if(ch=='I')
    29             {
    30                 node a;
    31                 scanf("%d",&a.v);
    32                 getchar();
    33                 s.push(a);
    34                 if(s.size()>k)
    35                     s.pop();
    36             }
    37             else if(ch=='Q')
    38             {
    39                 getchar();
    40                 printf("%d
    ",s.top().v);
    41             }
    42         }
    43     }
    44 }
  • 相关阅读:
    备战-Java 并发
    备战-Java 容器
    备战-Java 基础
    算法-链表
    2021-常见问题收集整理-1
    算法-双指针
    HTTP 下载文件的一些记录
    语义化版本 2.0.0
    勒索病毒典型传播途径与预防建议
    看杨院士如何解读——北斗与综合PNT体系
  • 原文地址:https://www.cnblogs.com/a1225234/p/5040246.html
Copyright © 2011-2022 走看看