🚀 go-pugleaf

gnustikos wrote:

> Moje pytanie brzmi oczywiscie, jak to zrobic najszybciej i/lub 
> najoptymalniej? Nie jestem specem od STL'a i nie znalazlem w
> manualu tej kolejki nic, co by mnie usatysfak- cjonowalo, a
> grzebanie w jakichs niskopoziomowych funkcjach operowania na kopcu
> byloby dla mnie problematyczne.

Moze to Ci pomoze: (z http://www.sgi.com/tech/stl/priority_queue.html)

"[2] This restriction is the only reason for priority_queue to exist 
at all. If iteration through elements is important, you can either use 
a vector that is maintained in sorted order, or a set, or a vector 
that is maintained as a heap using make_heap, push_heap, and pop_heap. 
Priority_queue is, in fact, implemented as a random access container 
that is maintained as a heap. *The only reason to use the container 
adaptor priority_queue, instead of performing the heap operations 
manually, is to make it clear that you are never performing any 
operations that might violate the heap invariant*."

Pozdrawiam.
-- 
Marcin Kral