Problem About Priority Queue STL !!!!

Chok · Post by **Chok** » Wed Nov 16, 2005 5:01 pm

Hi all,
I want to know how can i use priority_queue STL when the top element will be the maximum value. Default constructor are increasing order, thats why when i modified them then i got compile error. Please help me. Thanks in advance.

misof · Post by **misof** » Wed Nov 16, 2005 5:52 pm

Code: Select all

priority_queue<myClass, vector<myClass>, greater<myClass> > myQueue

Chok · Post by **Chok** » Wed Nov 16, 2005 9:14 pm

Hi misof,
Thankx for ur reply. But one question again, what is the type of myClass ? vector<int>myClass ??

Krzysztof Duleba · Post by **Krzysztof Duleba** » Wed Nov 16, 2005 10:19 pm

LOL! Which key is the "any key"?

misof · Post by **misof** » Wed Nov 16, 2005 11:22 pm

Chok wrote:Hi misof,
Thankx for ur reply. But one question again, what is the type of myClass ? vector<int>myClass ??

(Sigh.)

myClass is an arbitrary class such that the instances can be compared using the < operator. Any of the default types will work.

Code: Select all

priority_queue<int, vector<int>, greater<int> > Q;
Q.push(6);
Q.push(2);
Q.push(145);
cout << Q.top() << endl;