The kth great number - set

最新推荐文章于 2021-08-11 05:19:27 发布

努力写题的tyf

最新推荐文章于 2021-08-11 05:19:27 发布

阅读量255

点赞数

分类专栏： stl 文章标签： stl acm

本文链接：https://blog.csdn.net/m0_37579232/article/details/79313765

版权

stl 专栏收录该内容

32 篇文章 1 订阅

订阅专栏

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.

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

#include<iostream>
#include<cstdio>
#include<set>

using namespace std;

int main(){
    int n,k,d;
    char ch;
    while(cin>>n>>k){
        multiset<int> s;
        while(n--){
            cin>>ch;
            if(ch=='I'){
                cin>>d;
                s.insert(d);
                if(s.size()>k)s.erase(s.begin());
            }
            else cout<<*s.begin()<<endl;
        }
    }
}

这里用到了multiset

1.需要用头文件#include<set>

2.不同于集合set的是允许重复的数存在

3.set中元素自动从小到大排列

4.s.begin()与s.end()都是指针，指向地址，所以最后输出的时候加*

5.我刚开始做的时候用的数组，而且还保存了输入的每一个数（太蠢了）结果超时了，题上只问你，第k大的数是多少，所以只保留k个元素，当s.size()>k是就s.erase(s.begin())把最小的数去掉。

set讲解：

http://blog.sina.com.cn/s/blog_aa90eb1e0101edew.html