1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <queue> 11 12 // template <class InputIterator> 13 // priority_queue(InputIterator first, InputIterator last, 14 // const Compare& comp, const container_type& c); 15 16 #include <queue> 17 #include <cassert> 18 19 int main() 20 { 21 int a[] = {3, 5, 2, 0, 6, 8, 1}; 22 const int n = sizeof(a)/sizeof(a[0]); 23 std::vector<int> v(a, a+n/2); 24 std::priority_queue<int> q(a+n/2, a+n, std::less<int>(), v); 25 assert(q.size() == n); 26 assert(q.top() == 8); 27 } 28