C++ da standart konteyner kutubxonasi bilan qanday ishlaysiz?

#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm> // std::sort, std::find va boshqa
#include <iostream>

int main() {
    // std::vector - dinamik massiv
    std::vector<int> vec = {1, 2, 3, 4, 5};
    vec.push_back(6); // Elementni oxiriga qo'shish
    std::cout << "Vektor o'lchami: " << vec.size() << std::endl;
    std::cout << "Birinchi element: " << vec[0] << std::endl;

    // std::list - ikki tomonlama bog'langan ro'yxat
    std::list<int> lst = {10, 20, 30};
    lst.push_front(5); // Boshlashga qo'shish
    lst.push_back(35); // Oxiriga qo'shish
    // Iteratorlardan foydalanib o'tish va o'zgartirish:
    auto it = lst.begin();
    std::advance(it, 2); // 2 pozitsiya oldinga
    lst.insert(it, 25); // Hozirgi pozitsiyadan oldin joylash
    // Boshqa operatsiyalar:
    lst.remove(10); // Qiymat bo'yicha o'chirish

    // std::map - tartiblangan kalit-qiymatli xarita
    std::map<std::string, int> counts;
    counts["apple"] = 1;
    counts["banana"] = 2;
    counts["orange"] = 3;
    std::cout << "Bananda soni: " << counts["banana"] << std::endl;
    if (counts.count("kiwi")) { // Kalit mavjudligini tekshirish
        std::cout << "Kivi mavjud." << std::endl;
    }

    // std::unordered_map - tartibsiz hash xarita
    std::unordered_map<std::string, int> fast_counts;
    fast_counts["apple"] = 1;
    fast_counts["banana"] = 2;
    // Elementga kirish:
    std::cout << "Tez hisob: " << fast_counts.at("apple") << std::endl;

    // std::set - tartiblangan noyob elementlar to'plami
    std::set<int> unique_numbers = {5, 2, 8, 2, 5};
    std::cout << "To'plam elementlari:";
    for (int num : unique_numbers) {
        std::cout << " " << num; // Chiqish: 2 5 8 (tartiblangan va noyob)
    }
    std::cout << std::endl;
    unique_numbers.insert(10); // Yangi element qo'shish

    // std::unordered_set - tartibsiz noyob elementlar to'plami
    std::unordered_set<int> fast_unique_numbers = {5, 2, 8, 2, 5};
    std::cout << "Tartibsiz to'plam elementlari:";
    for (int num : fast_unique_numbers) {
        std::cout << " " << num; // Tartib o'zgarishi mumkin
    }
    std::cout << std::endl;

    // Standart algoritmlardan foydalanish
    std::vector<int> sort_vec = {3, 1, 4, 1, 5, 9};
    std::sort(sort_vec.begin(), sort_vec.end()); // Vektorni tartiblash

    // Elementni qidirish
    auto find_it = std::find(sort_vec.begin(), sort_vec.end(), 4);
    if (find_it != sort_vec.end()) {
        std::cout << "4 topildi." << std::endl;
    }

    return 0;
}