• <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

            久久91精品国产91久久小草| 亚洲精品白浆高清久久久久久| 久久精品国产亚洲网站| 久久伊人精品青青草原日本| 国产精品成人99久久久久 | 久久精品国产亚洲Aⅴ香蕉| 久久婷婷五月综合成人D啪 | 日韩亚洲欧美久久久www综合网| 久久综合成人网| 亚洲精品乱码久久久久久 | www.久久精品| 久久无码人妻一区二区三区午夜 | 狠狠精品干练久久久无码中文字幕 | 亚洲精品蜜桃久久久久久| 狠狠干狠狠久久| 伊人久久大香线蕉综合Av| 三级三级久久三级久久| 性做久久久久久久久| 亚洲国产成人久久精品99 | 久久国产综合精品五月天| 五月丁香综合激情六月久久| 人妻少妇精品久久| 久久久久亚洲精品无码网址 | 91精品国产91久久| 久久久久99精品成人片直播| 久久久精品国产sm调教网站| 伊人久久一区二区三区无码| 狠狠色伊人久久精品综合网| 久久91精品国产91久久麻豆| 久久综合久久自在自线精品自| 三级片免费观看久久| 欧美日韩精品久久久久| 久久精品18| 久久国产综合精品五月天| 欧美精品丝袜久久久中文字幕| 久久国产视屏| 亚洲国产高清精品线久久 | 午夜视频久久久久一区 | 久久国产色AV免费看| 久久久久亚洲AV无码网站| av无码久久久久不卡免费网站|