Vectors keep items in order and grow as new values are appended.

Vector Growth

vector_growth.cpp
#include <iostream>
#include <vector>

int main() {
    int extra = ;

    std::vector<int> scores{4, 6};
    scores.push_back(extra);

    int size = static_cast<int>(scores.size());
    int last = scores.back();

    std::cout << "size=" << size << std::endl;
    std::cout << "last=" << last << std::endl;
    return 0;
}
#include <iostream>
#include <vector>

int main() {
    int extra = ;

    std::vector<int> scores{4, 6};
    scores.push_back(extra);

    int size = static_cast<int>(scores.size());
    int last = scores.back();

    std::cout << "size=" << size << std::endl;
    std::cout << "last=" << last << std::endl;
    return 0;
}
#include <iostream>
#include <vector>

int main() {
    int extra = ;

    std::vector<int> scores{4, 6};
    scores.push_back(extra);

    int size = static_cast<int>(scores.size());
    int last = scores.back();

    std::cout << "size=" << size << std::endl;
    std::cout << "last=" << last << std::endl;
    return 0;
}
vector A `std::vector` stores values in order and supports indexed access.
push_back `push_back` appends a new value to the end of the vector.