• <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精品国产高清久久久久久io| 精品伊人久久久| 99久久亚洲综合精品网站| 久久国产亚洲精品麻豆| 亚洲色大成网站WWW久久九九| 久久亚洲欧洲国产综合| 久久夜色tv网站| 一级a性色生活片久久无| 国内精品久久久久久久亚洲| 国产精品福利一区二区久久| 欧美精品丝袜久久久中文字幕| 99精品国产99久久久久久97 | 久久婷婷国产综合精品| 99精品久久久久久久婷婷| 亚洲国产精品无码久久SM| 久久强奷乱码老熟女网站| 久久久久久免费视频| 一级做a爰片久久毛片免费陪| 久久综合久久久| 国内精品九九久久久精品| 欧美午夜A∨大片久久| 青青久久精品国产免费看| 国产午夜精品理论片久久影视 | 久久av无码专区亚洲av桃花岛| 久久99这里只有精品国产| 久久精品国产99久久久香蕉| 久久精品国产一区二区| 青青草国产精品久久久久| 久久91亚洲人成电影网站| 国内精品久久久久影院免费| 香蕉久久夜色精品升级完成| 久久久久久国产精品无码下载| 精品久久久久成人码免费动漫 | 97久久超碰国产精品旧版| 久久棈精品久久久久久噜噜| 少妇精品久久久一区二区三区| 亚洲午夜久久久久久久久久|