優先度付きキューというデータ構造を管理できる型(降順、昇順など)
a.push(x) (xを追加)
a.pop() (xを削除)
a.top() (xを習得)
a.size()
a.empty()
計算量は O(logN)
//最も小さい値を取り出す(定義)
priority_queue<int, vector<int>, greater<int>> a;
//最も大きい値を取り出す(定義)
priority_queue<int, vector<int>, less<int>> b;
More than 3 years have passed since last update.
Register as a new user and use Qiita more conveniently
- You get articles that match your needs
- You can efficiently read back useful information
- You can use dark theme