priority_queue_benchmark.cpp

#include <queue>
#include <iostream>
#include <cstdlib>
#include <ctime>

using namespace std;

void benchmark(int len)
{
    priority_queue<int> q;

    clock_t start = clock();
    for (int i = 0; i < len; i++) {
        q.push(rand());
    }
    clock_t end = clock();

    cout << "len = " << len << ", time = " << (end - start) / (double) CLOCKS_PER_SEC << endl;
}

int main()
{
    benchmark(1000 * 1000);
    benchmark(10 * 1000 * 1000);
    benchmark(100 * 1000 * 1000);

    return 0;
}