C++优先队列基本使用方法.docVIP

C++优先队列的基本使用方法?#includeiostream#includefunctional#includequeueusing namespace std; struct node{????friend bool operator (node n1, node n2)????{????????return n1.priority n2.priority;//为从大到小排列，为从小打到排列????}????int priority;????int value;}; int main(){????const int len = 5;????int i;????int a[len] = {3,5,9,6,2};????//示例1????priority_queueint qi;//普通的优先级队列，按从大到小排序????for(i = 0; i len; i++)????????qi.push(a[i]);????for(i = 0; i len; i++)????{????????coutqi.top() ;????????qi.pop();????}????coutendl; ????//示例2????priority_queueint, vectorint, greaterint qi2;//从小到大的优先级队列