다음을 통해 공유


priority_queue::push

Adds an element to the priority queue based on the priority of the element from operator<.

void push( 
   const Type& _Val 
);

매개 변수

  • _Val
    The element added to the top of the priority_queue.

설명

The top of the priority_queue is the position occupied by the largest element in the container.

예제

// pqueue_push.cpp
// compile with: /EHsc
#include <queue>
#include <iostream>

int main( )
{
   using namespace std;
   priority_queue<int> q1;

   q1.push( 10 );
   q1.push( 30 );
   q1.push( 20 );

   priority_queue<int>::size_type i;
   i = q1.size( );
   cout << "The priority_queue length is " << i << "." << endl;

   const int& ii = q1.top( );
   cout << "The element at the top of the priority_queue is "
        << ii << "." << endl;
}
  

요구 사항

Header: <queue>

네임스페이스: std

참고 항목

참조

priority_queue 클래스

priority_queue 함수

표준 템플릿 라이브러리