#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

template<class T, class U>
class MyMap {
private:
    vector<T> keys;
    vector<U> values;
public:
    void insert(T key, U value) {
        keys.push_back(key);
        values.push_back(value);
    }
    U find( T key ) { for(int i=0; i<keys.size(); i++) if(key == keys[i]) return values[i]; return 0; }
};
/*

int main()
{
    MyMap<string, int> grades;
    grades.insert("Jones", 88);
    grades.insert("Smith", 90);
    cout << grades.find("Smith") << endl;
   
    MyMap<int, string> numbers;
    numbers.insert(1, "one");
    numbers.insert(2, "two");
    cout << numbers.find(1) << endl;

    return 0;
}
*/