关闭

杭电 4006 multiset 妙用

794人阅读 评论(0) 收藏 举报

   用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;
}


1
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:613160次
    • 积分:10799
    • 等级:
    • 排名:第1493名
    • 原创:414篇
    • 转载:2篇
    • 译文:0篇
    • 评论:119条
    最新评论