#ifndef MAP
#define MAP
#include <iostream>
#include <cstdlib>
using namespace std;

template <class T>
class myvector: public vector<T> {
};

//KEY must be copy constructable and equality comparable.
//VALUE must be copy constructable.
//CONTAINER must have const_iterator, begin, end, push_back.

template <class KEY, class VALUE,
	template <class U> class CONTAINER = myvector>
class map {
	CONTAINER<KEY> key;
	CONTAINER<VALUE> value;
public:
	const VALUE& find(const KEY& k) const {
		typename CONTAINER<VALUE>::const_iterator itv = value.begin();

		for (typename CONTAINER<KEY>::const_iterator itk = key.begin();
			itk != key.end(); ++itk, ++itv) {

			if (*itk == k) {
				return *itv;
			}
		}

		cerr << "key not found\n";
		exit(EXIT_FAILURE);
	}

	void insert(const KEY& k, const VALUE& v) {
		key  .push_back(k);
		value.push_back(v);
	}
};
#endif