namespace ; () { priority_queue<> 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); q.pop(); (!q.empty()) { cout << q.top() << ''; q.pop(); } cout << endl; }
stl priority queue
最新推荐文章于 2024-05-29 17:18:10 发布