杭电 4006 multiset 妙用

原创 2012年03月27日 15:09:22

   用stl可以解决。。题目:

The kth great number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 2574    Accepted Submission(s): 1119


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

ac代码:

#include <iostream>
#include <string.h>
#include <algorithm>
#include <set>
#include <cstdio>
using namespace std;
int main(){
  //freopen("11.txt","r",stdin);
  int n,k;
  char ch;
  while(~scanf("%d%d",&n,&k)){
	  int x;
	  multiset<int> ss;
	  while(n--){
	    cin>>ch;
		if(ch=='I'){
		  scanf("%d",&x);
		  ss.insert(x);
			  if(ss.size()>k)
			  ss.erase(ss.begin());
		}
		else{
		  printf("%d\n",*ss.begin());
		}
	  }
  }
  return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

杭电ACM课件2014版

  • 2015-03-20 15:05
  • 13.46MB
  • 下载

杭电ACM课件2014版

  • 2014-10-30 13:39
  • 13.46MB
  • 下载

hdoj 4006 The kth great number

The kth great number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/...

杭电acm答案

  • 2015-02-02 23:43
  • 451KB
  • 下载

杭电OJ水题

  • 2015-06-23 16:30
  • 52KB
  • 下载

HDU 4006 The kth great number (求动态第k大值【Treap】)

题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=4006 The kth great numberTime Limit: 2000/1000...

杭电计算机体系结构PPT

  • 2015-01-13 18:42
  • 17.52MB
  • 下载

杭电题目分类

Bzoj4006:[JLOI2015]管道连接:斯坦纳树

题目连接:4006:[JLOI2015]管道连接 刚刚学会的斯坦纳树QAQ 把关键点之间的联通性加入状态,枚举当前考虑的点进行转移即可 #include #include #include #i...

杭电acm2000题

  • 2015-04-26 16:54
  • 538B
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)