Time
Limit: 2000/1000 MS (Java/Others) Memory Limit:
65768/65768 K (Java/Others)
Total Submission(s):
6020 Accepted Submission(s):
2436
1 #include<iostream> 2 #include<set> 3 using namespace std; 4 5 int main() 6 { 7 int n,k,i,temp; 8 char ss[2]; 9 multiset<int> sta; 10 while(scanf("%d%d",&n,&k)!=EOF) 11 { 12 sta.clear(); 13 for(i=0;i<n;i++) 14 { 15 scanf("%s",ss); 16 if(*ss==‘I‘) 17 { 18 scanf("%d",&temp); 19 if(i<k) sta.insert(temp); 20 else 21 { 22 int head=*sta.begin(); 23 if(temp>head) 24 { 25 sta.erase(sta.begin()); 26 sta.insert(temp); 27 } 28 } 29 } 30 else cout<<*(sta.begin())<<endl; 31 } 32 } 33 return 0; 34 }
方法二:
采取传统的最小堆,最大堆求解..
HDUOJ----4006The kth great number(最小堆...),布布扣,bubuko.com
HDUOJ----4006The kth great number(最小堆...)
原文:http://www.cnblogs.com/gongxijun/p/3602132.html