标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 9415 Accepted Submission(s): 3756
#include <queue> #include <vector> #include <iostream> using namespace std; int main() { char op[10]; int n, k, num; while(cin>>n >> k) { //priority_queue<int, vector<int>, cmp>q; priority_queue<int, vector<int>, greater<int> >q; //小元素在队首, 队内元素有序; for(int i=0; i<n; i++) { cin>> op; if(op[0]==‘I‘) { cin>>num; if(q.size() < k) { q.push(num); continue; } if(q.size() == k) { if(num> q.top()) { q.pop(); q.push(num); } } } else { cout<<q.top()<<‘\n‘; } } } return 0; }
#include <vector> #include <queue> #include <iostream> using namespace std; int main() { priority_queue<int, vector<int> > q;//默认大元素在队首 ; q.push(10); q.push(8); q.push(20); cout<<q.top()<<‘\n‘; return 0; }
hdoj 4006 The kth great number(优先队列)
标签:
原文地址:http://www.cnblogs.com/fengshun/p/5524718.html