• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            coreBugZJ

            此 blog 已棄。

            The kth great number, The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest

            The kth great number

            Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)

            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).
             


            打個醬油。
            小根堆保存最多 K 個元素,對每次詢問輸出堆頂元素。



             1 #include <iostream>
             2 #include <cstdio>
             3 #include <algorithm>
             4 #include <queue>
             5 
             6 using namespace std;
             7 
             8 typedef  priority_queue< int, vector< int >, greater< int > >  Heap;
             9 
            10 int main() {
            11         Heap mh;
            12         int n, k, x;
            13         char cmd[ 3 ];
            14         while ( 2 == scanf( "%d%d"&n, &k ) ) {
            15                 while ( ! mh.empty() ) {
            16                         mh.pop();
            17                 }
            18                 while ( n-- > 0 ) {
            19                         scanf( "%s", cmd );
            20                         if ( 'I' == cmd[ 0 ] ) {
            21                                 scanf( "%d"&x );
            22                                 mh.push( x );
            23                                 while ( mh.size() > k ) {
            24                                         mh.pop();
            25                                 }
            26                         }
            27                         else {
            28                                 printf( "%d\n", mh.top() );
            29                         }
            30                 }
            31         }
            32         return 0;
            33 }
            34 

            posted on 2011-09-03 18:17 coreBugZJ 閱讀(363) 評論(0)  編輯 收藏 引用 所屬分類: ACM

            久久精品国产男包| 精品久久久久久亚洲精品| www.久久99| 久久亚洲高清观看| 久久免费精品视频| 久久精品国产亚洲AV不卡| 一本久久a久久精品综合香蕉| 日产精品久久久久久久| 亚洲精品美女久久久久99| 99久久精品免费看国产免费| 久久99国产精品久久99小说| 久久久精品午夜免费不卡| 天堂无码久久综合东京热| 麻豆一区二区99久久久久| 99久久免费只有精品国产| 伊人久久大香线蕉av不卡 | 国产成年无码久久久免费| 精品久久久久香蕉网| 亚洲精品国产自在久久| 久久精品一区二区三区不卡| 久久精品国产亚洲AV久| 麻豆精品久久久一区二区| 人妻少妇久久中文字幕| 久久亚洲精品无码播放| 久久伊人精品青青草原高清| 无码日韩人妻精品久久蜜桃| 久久久久亚洲精品中文字幕 | 久久国产成人| 国产精品久久久久久一区二区三区 | 久久精品国产免费观看| 亚洲综合久久综合激情久久| 日韩精品久久久久久久电影蜜臀| 久久国产综合精品五月天| 久久久中文字幕| 欧美一区二区精品久久| 奇米影视7777久久精品| 亚洲国产精品无码久久| 国产精品成人久久久| 久久亚洲国产成人影院| 久久只这里是精品66| 亚洲人AV永久一区二区三区久久|