hash_map vs vector

#include <vector>
#include <hash_map>
#include <time.h>

#define VECTOR_BASED    0
#define HASHMAP_BASED   1

#define SAMPLE_COUNT    1000

#define METHOD_USED     HASHMAP_BASED

using namespace std;

int main(int argc, char** argv)
{
#if METHOD_USED == VECTOR_BASED
    vector<int> val_tab(32);
#elif METHOD_USED == HASHMAP_BASED
    hash_map<int, int> val_tab;
#else
    int hash_map[32];
#endif

    clock_t ins_min=99999,ins_max=0,ins_avg=0;
    clock_t out_min=99999,out_max=0,out_avg=0;

    clock_t start;

    printf("sampling insertion time n=%u.....", SAMPLE_COUNT);
    for(int i=0; i<SAMPLE_COUNT; i++)
    {
        start=clock();

        val_tab[9]=0;
        val_tab[31]=-12;
        val_tab[24]=23;

        start=clock()-start;

        ins_max=start>ins_max?start:ins_max;
        ins_min=start<ins_min?start:ins_min;
        ins_avg+=start;
    }
    printf("done.\n");

    printf("sampling output time n=%u.....", SAMPLE_COUNT);
    for(int c=0; c<SAMPLE_COUNT; c++)
    {
        start=clock();
        for(int i=0; i<32; i++)
        {
            val_tab[i]=val_tab[i]*23;
        }
        start=clock()-start;

        out_max=start>out_max?start:out_max;
        out_min=start<out_min?start:out_min;
        out_avg+=start;
    }
    printf("done.\n");
    printf("\n");

    printf("insertion time: min=%u ms, max=%u ms, avg=%.4f ms\n", ins_min, ins_max, ins_avg*0.001);
    printf("output time: min=%u ms, max=%u ms, avg=%.4f ms\n", out_min, out_max, out_avg*0.001);

    return 0;
}