C++ hashing programme with chaining

#include <iostream>
#include <vector>
#include <list>

// Define the size of the hash table
const int tableSize = 10;

// Define a class to represent key-value pairs
class KeyValuePair {
public:
    int key;
    int value;

    KeyValuePair(int k, int v) : key(k), value(v) {}
};

// Define a hash table using an array of lists (chaining)
class HashTable {
public:
    HashTable() : table(tableSize) {}

    // Hash function to determine the index for a given key
    int hash(int key) {
        return key % tableSize;
    }

    // Insert a key-value pair into the hash table
    void insert(int key, int value) {
        int index = hash(key);
        for (auto& pair : table[index]) {
            if (pair.key == key) {
                // Key already exists; update the value
                pair.value = value;
                return;
            }
        }
        // Key does not exist; insert a new key-value pair
        table[index].emplace_back(key, value);
    }

    // Retrieve the value associated with a key
    int get(int key) {
        int index = hash(key);
        for (auto& pair : table[index]) {
            if (pair.key == key) {
                return pair.value; // Key found; return the associated value
            }
        }
        return -1; // Key not found
    }

private:
    std::vector<std::list<KeyValuePair>> table;
};

int main() {
    HashTable hashTable;

    // Insert key-value pairs into the hash table
    hashTable.insert(1, 42);
    hashTable.insert(11, 101);
    hashTable.insert(21, 999);

    // Retrieve values using keys
    int value1 = hashTable.get(1);
    int value11 = hashTable.get(11);
    int valueNonExistent = hashTable.get(7);

    // Display the retrieved values
    std::cout << "Value for key 1: " << value1 << std::endl;       // 42
    std::cout << "Value for key 11: " << value11 << std::endl;     // 101
    std::cout << "Value for non-existent key 7: " << valueNonExistent << std::endl; // -1

    return 0;
}