priority_queue POJ 3253 Fence Repair
摘要：
#include <iostream>
#include <queue>
using namespace std; int main(void)
{ priority_queue<double> q; q.push(66.6); q.push(22.2); q.push(44.4); cout << q.top() << ' '; q.pop(); cout << q.top() << endl; q.pop(); q.push(11.1); q.push(55.5); q.push(33.3) 阅读全文
posted @ 2012-05-12 22:54 jjtx 阅读(195) 评论(0) 推荐(0) 编辑
