#include <iostream>
#include <queue>
#include <time.h>

int main()
{
  // Replace this with a leftist_tree:
  std::priority_queue<int> pq;

  double start_time = clock();

  // Insert some random values.
  for (int i = 0; i < 100000; ++i)
    pq.push(i);

  // Now remove them.
  while (!pq.empty())
    pq.pop();

  double stop_time = clock();
  std::cout << "time: " << (stop_time - start_time)/CLOCKS_PER_SEC 
            << " seconds" << std::endl;
}